Text
MODEL SET COVERING PROBLEM MENGGUNAKAN GREEDY REDUCTION ALGORITHM DALAM MENENTUKAN LOKASI TPS SAMPAH DI DESA PULAU SEMAMBU KABUPATEN OGAN ILIR PROVINSI SUMATERA SELATAN
The purpose of this research is to optimize the location of the Temporary Disposal Site (TPS) for waste. The data used in this research include a list of names of TPS in Pulau Semambu Village, list of names for hamlets in Desa Pulau Semambu, definition of variables for each model, and the distance data from one TPS to another TPS in Pulau Semambu Village. One way of managing waste is creating a TPS. Pulau Semambu Village is a village that does not have a TPS. This research discusses determining the optimum location for TPS in Pulau Semambu Village. Pulau Semambu village has six hamlets, namely Hamlet 1 to Hamlet 6. This research is limited by the distance between TPS, namely 500 meters and 1000 meters, which aims to optimize the location of the TPS in Pulau Semambu Village to serve all demand points. This optimization uses a Covering Based model, which includes Location Set Covering Problem (LSCP) and P-Median Problem solved by Greedy Reduction Algorithm (GRA). Then the solution was obtained using LINGO 13.0 software. The calculation results conclude that for a maximum distance of 500 meters, there are six TPS built to serve six hamlets, namely TPS 2 Hamlet 1, TPS 1 Hamlet 2, TPS 2 Hamlet 3, TPS 1 Hamlet 4, TPS 2 Hamlet 5, and TPS 2 Hamlet 6. And for a maximum distance of 1000 meters, there are 6 TPS built to serve 6 hamlets, namely TPS 2 Hamlet 1, TPS 1 Hamlet 2, TPS 2 Hamlet 3, TPS 1 Hamlet 4, TPS 1 Hamlet 5, and TPS 2 Hamlet 6.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2207003203 | T76685 | T766852022 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available