dc.contributor.author |
Ramadhani, Desri Annisa |
|
dc.date.accessioned |
2024-02-28T02:27:56Z |
|
dc.date.available |
2024-02-28T02:27:56Z |
|
dc.date.issued |
2023-11 |
|
dc.identifier.citation |
Perpustakaan |
en_US |
dc.identifier.other |
Elfitra |
|
dc.identifier.uri |
https://repository.unri.ac.id/handle/123456789/11327 |
|
dc.description.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. |
en_US |
dc.description.provenance |
Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2024-02-28T02:27:56Z
No. of bitstreams: 1
Desri Annisa R_compressed.pdf: 193402 bytes, checksum: 2a09f4464498e7653c4798396b2d7c2a (MD5) |
en |
dc.description.provenance |
Made available in DSpace on 2024-02-28T02:27:56Z (GMT). No. of bitstreams: 1
Desri Annisa R_compressed.pdf: 193402 bytes, checksum: 2a09f4464498e7653c4798396b2d7c2a (MD5)
Previous issue date: 2023-11 |
en |
dc.description.sponsorship |
Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Elfitra |
en_US |
dc.subject |
Integer programming |
en_US |
dc.subject |
location set covering problem |
en_US |
dc.subject |
maximum covering location problem |
en_US |
dc.title |
MENENTUKAN LOKASI DAN JUMLAH POS PEMADAM KEBAKARAN DENGAN MENGGUNAKAN MODEL SET COVERING PROBLEM |
en_US |
dc.title.alternative |
Elfitra |
en_US |
dc.type |
Article |
en_US |