Image of Menentukan Lokasi Dan Jumlah Pos Pemadam Kebakaran Dengan Menggunakan Model Set Covering Problem
Penanda Bagikan

CD Skripsi

Menentukan Lokasi Dan Jumlah Pos Pemadam Kebakaran Dengan Menggunakan Model Set Covering Problem

This final project discusses the use of the Set Covering Problem (SCP) model in determining the optimal location and number of fire stations in Pekanbaru City. The SCP model includes Location Set Covering Problem (LSCP) and Maximum Covering Location Problem (MCLP). Problems in this model are solved using the LINGO 18.0 application. Based on the LSCP model with a maximum travel time of 15 minutes, the minimum number of fire station locations is eight fire stations. The results of the LSCP model are used to formulate the MCLP model to improve fire station services, so that every subdistrict can be served. The SCP model provides minimum results for fire stations and fire stations locations, as well as optimal fire station service coverage so that it can serve every subdistrict.
Keywords: Integer programming, location set covering problem, maximum covering location problem.

Ketersediaan

Tidak ada salinan data

Informasi Detail
Judul Seri
-
No. Panggil
1903155695
Penerbit
Pekanbaru : Universitas Riau – FMIPA – Matematika.,
Deskripsi Fisik
-
Bahasa
Indonesia
ISBN/ISSN
-
Klasifikasi
1903155695
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
-
Subjek
MATEMATIKA
Info Detail Spesifik
-
Pernyataan Tanggungjawab
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
Komentar
Anda harus masuk sebelum memberikan komentar