Set Covering Problem with the Reduction Heuristic Method in Determining Garbage TPS Locations in Semambu Island Village South Sumatra Fitri Maya Puspita, Novi Rustiana Dewi, Evi Yuliza, Sisca Octarina and Yulia Anisawati
Universitas Sriwijaya
Abstract
This study discusses the Set Covering Problem (SCP) in determining the optimal location of the Temporary Disposal Site (TDS) in Pulau Semambu Village. The data used in this study are hamlet name data, garbage TPS name data, defining variables for each model, and distance measurement data between TDS. Semambu Island Village consists of 6 hamlets with 12 waste disposal sites. Optimization of TDS in Semambu Island Village was carried out using the Location Set Covering Problem (LSCP) and P-Median Problem models with the help of LINGO 13.0 Software and using the Reduction Heuristic. This study uses a minimum distance of 500 meters, 850 meters and 1000 meters. Solutions from all calculations are compared, so that it can be concluded that for a minimum distance of 500 meters there are 6 TDS, namely TDS 2 Hamlet 1, TDS 1 Hamlet 2, TDS 2 Hamlet 3, TDS 2 Hamlet 4.
Keywords: Set Covering Problem, Temporary Disposal Site, Location Set Covering Problem, Pulau Semambu Village
