MENENTUKAN LOKASI DAN JUMLAH POS PEMADAM KEBAKARAN DENGAN MENGGUNAKAN MODEL SET COVERING PROBLEM
No Thumbnail Available
Date
2023-11
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Elfitra
Abstract
This article 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, 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. The SCP model provides optimal
results in determining the location and number of fire stations.
Description
Keywords
Integer programming, location set covering problem, maximum covering location problem
Citation
Perpustakaan