Research Article
Set Covering Problem with the Reduction Heuristic Method in Determining the Temporary Disposal Site Locations in Pulau Semambu Village in South Sumatra
@INPROCEEDINGS{10.4108/eai.3-11-2023.2347897, author={Fitri Maya Puspita and Novi Rustiana Dewi and Evi Yuliza and Sisca Octarina and Yulia Anisawati}, title={Set Covering Problem with the Reduction Heuristic Method in Determining the Temporary Disposal Site Locations in Pulau Semambu Village in South Sumatra}, proceedings={Proceedings of the 3rd Sriwijaya International Conference on Basic and Applied Sciences, SICBAS 2023, November 3, 2023, Palembang, Indonesia}, publisher={EAI}, proceedings_a={SICBAS}, year={2024}, month={8}, keywords={set covering problem reduction heuristic location set covering problem p-median problem pulau semambu village temporary disposal site}, doi={10.4108/eai.3-11-2023.2347897} }- Fitri Maya Puspita
Novi Rustiana Dewi
Evi Yuliza
Sisca Octarina
Yulia Anisawati
Year: 2024
Set Covering Problem with the Reduction Heuristic Method in Determining the Temporary Disposal Site Locations in Pulau Semambu Village in South Sumatra
SICBAS
EAI
DOI: 10.4108/eai.3-11-2023.2347897
Abstract
The research attempts to show the Set Covering Problem (SCP) in finding the optimal location of Temporary Disposal Site (TDS) in Pulau Semambu Village, South Sumatra. Those attempts occur due to the least awareness of people in that village to have TDS permanently. Then, the design for TDS is needed critically. The data used then are hamlet name, TDS name, variables used for each model, and distance measurement between TDS. Having 6 hamlets with 12 waste disposal sites makes Pulau Semambu Village need to arrange the optimal location of the TDS. Models designed are classified as Location Set covering Problem (LSCP) and P-Median Problem by utilizing the LINGO 13.0 Software and Reduction Heuristic (RH). The minimum distances applied are 500m, 850m, and 1000m. Based on the results obtained, it can be concluded that a minimum distance of 500 meters is for 6 TDS, namely TDS B Hamlet A, TDS A Hamlet B, TDS B Hamlet C, TDS B Hamlet D.
