MENENTUKAN LOKASI DAN JUMLAH POS PEMADAM KEBAKARAN DENGAN MENGGUNAKAN MODEL SET COVERING PROBLEM

Simple item page
dc.contributor.authorRamadhani, Desri Annisa
dc.date.accessioned2024-02-28T02:27:56Z
dc.date.available2024-02-28T02:27:56Z
dc.date.issued2023-11
dc.description.abstractThis 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.sponsorshipFakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riauen_US
dc.identifier.citationPerpustakaanen_US
dc.identifier.otherElfitra
dc.identifier.urihttps://repository.unri.ac.id/handle/123456789/11327
dc.language.isoenen_US
dc.publisherElfitraen_US
dc.subjectInteger programmingen_US
dc.subjectlocation set covering problemen_US
dc.subjectmaximum covering location problemen_US
dc.titleMENENTUKAN LOKASI DAN JUMLAH POS PEMADAM KEBAKARAN DENGAN MENGGUNAKAN MODEL SET COVERING PROBLEMen_US
dc.title.alternativeElfitraen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Desri Annisa R_compressed.pdf
Size:
188.87 KB
Format:
Unknown data format
Description:
artikel
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Mathematics