Set Covering Model Using Greedy Heuristic Algorithm to Determine The Temporary Waste Disposal Sites in Palembang
Abstract
Optimizing the facility location has a vital role in providing services to the community. This study aims to determine the Temporary Waste Disposal Site (TWDS) in Sako District, Palembang City. The distance data between each TWDS in Sako District is used to formulate the Set Covering model, consisting of the Set Covering Location Problem (SCLP) model and the p-Median Problem model. The classical approach is made by solving both models using Lingo 18.0 software. The Greedy Heuristic algorithm is used as the heuristic approach. Based on the results and discussion, Sako District consists of 4 Villages and 9 TWDS. The SCLP and p-Median Problem models with LINGO 18.0 software and the Greedy Heuristic algorithm show a difference. The study results suggest using the optimal solution resulting from the Greedy Heuristic algorithm because it can meet all requests in Sako District. Research shows that there are six optimal TWDS in Sako District. However, several locations are still not optimal, so it is recommended that there are an additional 14 new TWDS facilities in Sako District to serve all requests.
References
Amarilies, H. S., A. P. Redi, I. Mufidah, and R. Nadlifatin (2020). Greedy Heuristics for The Maximum Covering Lo- cation Problem: A Case Study of Optimal Trashcan Loca- tion in Kampung Cipare–Tenjo–West Java. IOP Conference Series: Materials Science and Engineering, 847; 012007
Ardiansyah, A. and Mardlijah (2019). Determination of Lo- cation and Numbers of Monorail Stops in Surabaya with Max Covering Problem Model. Journal of Physics: Conference Series, 1373; 012035
Berman, O., Z. Drezner, and D. Krass (2019). The Multiple Gradual Cover Location Problem. Journal of The Operational Research Society, 70(6); 931–940
Çalık, H. and B. Fortz (2019). A Benders Decomposition Method for Locating Stations in a One-Way Electric Car Sharing System Under Demand Uncertainty. Transportation Research Part B: Methodological, 125; 121–150
Cordeau, J. F., F. Furini, and I. Ljubić (2019). Benders De- composition for Very Large Scale Partial Set Covering and Maximal Covering Location Problems. European Journal of Operational Research, 275(3); 882–896
Crawford, B., R. Soto, N. Berríos, F. Johnson, and F. Paredes (2015). Solving The Set Covering Problem with Binary Cat Swarm Optimization. International Conference in Swarm Intelligence, 5; 41–48
Devi, S., A. Fatchiya, and D. Susanto (2016). Kapasitas Kader Dalam Penyuluhan Keluarga Berencana di Kota Palembang, Provinsi Sumatera Selatan. Jurnal Penyuluhan, 12(2); 144– 156. (in Indonesia)
Dzator, M. and J. Dzator (2015). An Efficient Modified Greedy Algorithm for The p-Median Problem. CQUniversity; 1855– 1861
Karataş, M., N. Razi, and H. Tozan (2017). A Multi-Criteria Assessment of The p-Median, Maximal Coverage and p- Center Location Models. Strojarski Facultet, 24; 399–407
Karatas, M. and E. Yakıcı (2018). An Iterative Solution Ap- proach to a Multi-Objective Facility Location Problem. Ap- plied Soft Computing, 62; 272–287
Katayama, N. (2019). A Combined Fast Greedy Heuristic for The Capacitated Multicommodity Network Design Problem. Journal of The Operational Research Society, 70(11); 1983– 1996
Kinsht, N. and N. Petrunko (2020). Multiple Partial Discharge Diagnostics as a Set Covering Problem. 2020 International Russian Automation Conference (RusAutoCon). ; 777–781
Kwon, Y. S., B. K. Lee, and S. Y. Sohn (2020). Optimal Location-Allocation Model for The Installation of Rooftop Sports Facilities in Metropolitan Areas. European Sport Man- agement Quarterly, 20(2); 189–204
Lutter, P., D. Degel, C. Büsing, A. M. Koster, and B. Werners (2017). Improved Handling of Uncertainty and Robustness in Set Covering Problems. European Journal of Operational Research, 263(1); 35–49
Min, F. and J. Xu (2016). Semi-Greedy Heuristics for Feature Selection with Test Cost Constraints. Granular Computing, 1(3); 199–211
Octarina, S., D. G. Juita, N. Eliyati, and P. B. J. Bangun (2020). Set Covering Model in Solving Multiple Cutting Stock Prob- lem. Science and Technology Indonesia, 5(4); 121–130
Sako District Strategic Plan.(2019). Rencana Strategis (Renstra) Tahun 2019 – 2023 Pemerintah Kota Palembang (Issue 01) (in Indonesia)
Puspita, F. M., S. Octarina, and H. Pane (2019). Pengopti- malan Lokasi Tempat Pembuangan Sementara (TPS) Meng- gunakan Greedy Reduction Algorithm (GRA) di Kecamatan Kemuning. Annual Research Seminar (ARS), 4; 267–274. (in Indonesia)
Silva, M. R. and C. B. Cunha (2017). A Tabu Search Heuristic for The Uncapacitated Single Allocation p-Hub Maximal Covering Problem. European Journal of Operational Research, 262(3); 954–965
Sitepu, R., F. M. Puspita, and S. Romelda (2019a). Covering Based Model Dalam Pengoptimalan Lokasi IGD Rumah sakit. Annual Research Seminar (ARS), 4; 261–266 (in In- donesia)
Sitepu, R., F. M. Puspita, S. Romelda, A. Fikri, B. Susanto, and H. Kaban (2019b). Set Covering Models in Optimizing The Emergency Unit Location of Health Facility in Palembang. Journal of Physics: Conference Series, 1282; 012008
Syakina, L. and S. Nurdiati (2021). Studi Literatur Analisis Distribusi Masalah Lokasi Fasilitas untuk Logistik Bantuan Kemanusiaan. Jurnal Pijar Mipa, 16(2); 207–214 (in In- donesia)
Tao, Z., Q. Zheng, and H. Kong (2018). A Modified Gravity p-Median Model for Optimizing Facility Locations. Journal
of Systems Science and Information, 6(5); 421–434
Wolf, G. W. (2019). Location Covering Models: History, Applications and Advancements (Advances in Spatial Sci- ence) International Journal of Geographical Information Science,
633(11); 2334–2335
Ye, H. and H. Kim (2016). Locating Healthcare Facilities Using
a Network-Based Covering Location Problem. GeoJournal, 81(6); 875–890
Authors

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.