Greedy Reduction Algorithm as the Heuristic Approach in Determining the Temporary Waste Disposal Sites in Sukarami Sub-District, Palembang, Indonesia

Sisca Octarina, Fitri Maya Puspita, Siti Suzlin Supadi, Nur Attina Eliza

Abstract

Waste is one of the problems in Palembang, Indonesia. The amount of waste in Palembang increases proportionally to the population yearly and can adversely affect the community. Therefore, we determine the optimal temporary waste disposal site (TWDS) to optimize the problems. The set covering model is the proper model for solving the location and allocation problem. In this study, data on the distance between each TWDS is needed in the set covering modeling. The novelty in this research is developing the p-median problem model, which is formed from the optimal solution of the set covering location problem (SCLP) model. Palembang consists of 18 sub-districts, of which the Sukarami sub-district has the highest population density. This study discussed the determination of strategic TWDS in the Sukarami sub-district using the SCLP model, the p-median problem, and a heuristic approach, namely the greedy reduction algorithm in solving the model. Based on the solution of the p-median problem model with LINGO 18.0 and the p-median problem solved by the greedy reduction algorithm, only three strategic TWDS were found for the Sukarami sub-district. The study results recommend a review of the existing TWDS and particularly the addition of a TWDS in Sukodadi and Talang Betutu villages, respectively.

References

Ahmadi-Javid, A., P. Seyedi, and S. S. Syam (2017). A Survey of Healthcare Facility Location. Computers & Operations Research, 79; 223–263

Ardeshiri, T., K. Granström, E. Özkan, and U. Orguner (2015). Greedy Reduction Algorithms for Mixtures of Exponential Family. IEEE Signal Processing Letters, 22(6); 676–680

Bangun, P. B. J., S. Octarina, R. Aniza, L. Hanum, F. M. Puspita, and S. S. Supadi (2022). Set Covering Model Using Greedy Heuristic Algorithm to Determine The Temporary Waste Disposal Sites in Palembang. Science and Technology Indonesia, 7(1); 98–105

Binev, P., A. Cohen, O. Mula, and J. Nichols (2018). Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models. SIAM/ASA Journal on Uncertainty Quantication, 6(3); 1101–1126

Ç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

Čertíková, M., L. Gaynutdinova, and I. Pultarová (2020). Multilevel a Posteriori Error Estimator for Greedy Reduced Basis Algorithms. SN Applied Sciences, 2(4); 1–19

Crawford, B., R. Soto, E. Monfroy, G. Astorga, J. García, and E. Cortes (2018). A Meta-optimization Approach to Solve the Set Covering Problem. Ingeniería, 23(3); 274–288

Cubillos, M. and S. Wøhlk (2021). Solution of the maximal covering tour problem for locating recycling drop-of stations Daskin, M. S. and K. L. Maass (2019). Location Analysis and Network Design. In Operations, logistics and supply chain management. Springer, pages 379–398

Du, B., H. Zhou, and R. Leus (2020). A Two-stage Robust Model for a Reliable P-center Facility Location Problem. Applied Mathematical Modelling, 77; 99–114

Guzmán, V. C., D. A. Pelta, and J. L. Verdegay (2016). An Approach for Solving Maximal Covering Location Problems With Fuzzy Constraints. International Journal of Computational Intelligence Systems, 9(4); 734–744

Jeong, I.-J. (2017). An Optimal Approach for a Set Covering Version of the Refueling-station Location Problem and Its Application to a Diffusion Model. International Journal of Sustainable Transportation, 11(2); 86–97

Kinsht, N. and N. Petrunko (2020). Multiple Partial Discharge Diagnostics as a Set Covering Problem. In International Russian Automation Conference (RusAutoCon). IEEE, pages 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 Management Quarterly, 20(2); 189–204

Muliyadi, M. (2017). Optimization Model of Integrated Logistics Using Continuous Review and Greedy Algorithm. Indonesian Journal of Information Technology, 1(2, Dec.); 20– 29

Octarina, S., F. M. Puspita, and S. S. Supadi (2022a). Models and Heuristic Algorithms for Solving Discrete Location Problems of Temporary Disposal Places in Palembang City. IAENG International Journal of Applied Mathematics, 52(2); 1–11

Octarina, S., F. M. Puspita, S. S. Supadi, R. Afrilia, and E. Yuliza (2022b). Set Covering Location Problem and P-median Problem Model in Determining the Optimal Temporary Waste Disposal Sites Location in Seberang Ulu I Sub-district Palembang. In AIP Conference Proceedings, volume 2577. AIP Publishing LLC, page 020046

Puspita, F. M., E. S. Cahyono, S. Rahayu, and B. L. Sintia (2018). Model of Demand Robust Counterpart Open Capacitated Vehicle Routing Problem (drc-ocvrp) Simplication by Applying Preprocessing Techniques in Rubbish Controlling in Sematang Borang District, Palembang. In E3S Web of Conferences, volume 68. EDP Sciences, page 01025

Roshanaei, V., C. Luong, D. M. Aleman, and D. Urbach (2017). Propagating Logic-based Benders’ Decomposition Approaches for Distributed Operating Room Scheduling. European Journal of Operational Research, 257(2); 439–455

Sanchez-Oro, J. and A. Duarte (2018). Iterated Greedy Algorithm for Performing Community Detection in Social Networks. Future Generation Computer Systems, 88; 785–791

Šarac, D., M. Kopić, K. Mostarac, M. Kujačić, and B. Jovanović (2016). Application of Set Covering Location Problem for Organizing the Public Postal Network. PROMETTrac&Transportation, 28(4); 403–413

Shao, W., Z. Shao, and D. Pi (2020). Modeling and Multineighborhood Iterated Greedy Algorithm for Distributed Hybrid Flow Shop Scheduling Problem. Knowledge-Based Systems, 194; 105527

Sitepu, R., F. M. Puspita, I. Lestari, E. Yuliza, S. Octarina, et al. (2022). Facility Location Problem of Dynamic Optimal Location of Hospital Emergency Department in Palembang. Science and Technology Indonesia, 7(2); 251–256

Sitepu, R., F. M. Puspita, S. Romelda, A. Fikri, B. Susanto, and H. Kaban (2019). Set Covering Models in Optimizing the Emergency Unit Location of Health Facility in Palembang. In Journal of Physics: Conference Series, volume 1282. IOP Publishing, page 012008

Xu, F. and J. Li (2018). A Hybrid Encoded Memetic Algorithm For Set Covering Problem. In Tenth International Conference on Advanced Computational Intelligence (ICACI). IEEE, pages 552–557

Yuliza, E., F. M. Puspita, and S. S. Supadi (2020). The Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows on Waste Transport Problems. Bulletin of Electrical Engineering and Informatics, 9(5); 2074–2081

Authors

Sisca Octarina
Fitri Maya Puspita
fitrimayapuspita@unsri.ac.id (Primary Contact)
Siti Suzlin Supadi
Nur Attina Eliza
Octarina, S., Puspita, F. M., Supadi, S. S., & Eliza, N. A. (2022). Greedy Reduction Algorithm as the Heuristic Approach in Determining the Temporary Waste Disposal Sites in Sukarami Sub-District, Palembang, Indonesia. Science and Technology Indonesia, 7(4), 469–480. https://doi.org/10.26554/sti.2022.7.4.469-480

Article Details

Most read articles by the same author(s)

1 2 > >>