DETERMINING THE OPTIMAL TEMPORARY WASTE DISPOSAL SITES IN THE ALANG-ALANG LEBAR SUB-DISTRICT PALEMBANG USING THE P-CENTRE LOCATION PROBLEM AND P-MEDIAN PROBLEM MODELS
Abstract
The rapid development of Palembang City comes with an increase in population and a proportionate increase in waste. Providing Temporary Waste Disposal Sites (TWDS) with ideal locations is one way to address the waste problem in Palembang City. The location of the existing TWDS could be more regular and optimal. The problem of determining the optimal TWDS location can be solved by optimization science, as classified in the Set Covering Problem (SCP) model. The SCP model is divided into the -Center Location Problem and -Median Problem models. This study aims to determine the optimal locations for TWDS in the Alang-Alang Lebar Sub-District, Palembang City, by comparing the results of the p-Center Location Problem and p-Median Problem models. Initially, the Alang-Alang Lebar Sub-District had 33 TWDS. After formulating the Set Covering Location Problem and Maximal Covering Location Problem models, we obtain the optimal solution, which we then solve using the -Center Location Problem and -Median Problem models. Based on the results and discussion, the optimal TWDS can meet the demand of each village in the Alang-Alang Lebar Sub-District. The -Center Location Problem and -Median Problem models produce the same optimal TWDS, namely TWDS Pramuka 2 Street and around, TWDS Colonel Sulaiman Amin Street, TWDS Talang Kelapa Ujung, and TWDS Beside Soekarno Hatta Street. This study recommends using both models to determine the optimal TWDS.
Downloads
References
UU RI No 18 Tahun 2008 Tentang Pengelolaan Sampah. 2008.
S. Andaryani, I. Utami, and D. Rusdi, “Pelaksanaan pengolahan sampah pada Dinas Lingkungan Hidup dan Kebersihan Kota Palembang,” PUBLIKA J. lmu Adm. Publik, vol. 9, no. 1, pp. 47–58, 2023, doi: 10.25299/jiap.2023.vol9(1).12551.
S. Octarina, F. M. Puspita, S. S. Supadi, and N. A. Eliza, “Greedy reduction algorithm as the heuristic approach in determining the temporary waste disposal sites in Sukarami Sub-District, Palembang, Indonesia,” Sci. Technol. Indones., vol. 7, no. 4, pp. 469–480, 2022, doi: 10.26554/sti.2022.7.4.469-480.
Ramadhani and I. Iskandar, “Waste management sites - Reduce, Reuse, and Recycle (TPS3R) construction study in Sekanak Area, Palembang City,” Int. J. Eng. Appl. Sci. Technol., vol. 7, no. 2, pp. 16–23, 2022, doi: 10.33564/ijeast.2022.v07i02.003.
R. Nirmalasari, P. Syafitri, M. D. Irawan, N. Fajar, and R. Haryanto, “Pengadaan Tempat Pembuangan Sampah Sementara (TPS) Sebagai Upaya Mewujudkan Kampung Bersih,” Surya Abdimas, vol. 6, no. 4, pp. 709–717, 2022.
P. B. J. Bangun, S. Octarina, R. Aniza, L. Hanum, F. M. Puspita, and S. S. Supadi, “Set covering model using greedy heuristic algorithm to determine the temporary waste disposal sites in Palembang,” Sci. Technol. Indones., vol. 7, no. 1, pp. 98–105, 2022.
N. Adelgren and A. Gupte, “Branch-and-bound for biobjective mixed integer programming,” 2020. [Online]. Available: http://arxiv.org/abs/1709.03668.
S. Octarina, F. M. Puspita, S. S. Supadi, R. Afrilia, and E. Yuliza, “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, 2022, pp. 1–10.
G. Bergantiños, M. Gómez-Rúa, N. Llorca, M. Pulido, and J. Sánchez-Soriano, “Allocating costs in set covering problems,” Eur. J. Oper. Res., vol. 284, no. 3, pp. 1074–1087, 2020, doi: 10.1016/j.ejor.2020.01.031.
A. Ahmadi-Javid, P. Seyedi, and S. S. Syam, “A survey of healthcare facility location,” Comput. Oper. Res., vol. 79, pp. 223–263, 2017, doi: 10.1016/j.cor.2016.05.018.
S. Octarina, F. M. Puspita, and S. S. Supadi, “Models and heuristic algorithms for solving discrete location problems of temporary disposal places in Palembang City,” IAENG Int. J. Appl. Math., vol. 52, no. 2, pp. 1–11, 2022.
C. Filippi, G. Guastaroba, D. L. Huerta-Muñoz, and M. G. Speranza, “A kernel search heuristic for a fair facility location problem,” Comput. Oper. Res., vol. 132, no. April, pp. 1–17, 2021, doi: 10.1016/j.cor.2021.105292.
Y. S. Kwon, B. K. Lee, and S. Y. Sohn, “Optimal location-allocation model for the installation of rooftop sports facilities in metropolitan areas,” Eur. Sport Manag. Q., vol. 20, no. 2, pp. 189–204, 2020, doi: 10.1080/16184742.2019.1598454.
A. Vaezihir, F. Safari, M. Tabarmayeh, and A. A. Khalafi, “Application of MCLP and LINGO methods to optimal design of groundwater monitoring network in an oil refinery site,” J. Hydroinformatics, vol. 23, no. 4, pp. 813–830, 2021, doi: 10.2166/hydro.2021.172.
X. Liu, Y. Fang, J. Chen, Z. Su, C. Li, and Z. Lu, “Effective approaches to solve p-center problem via set covering and SAT,” IEEE Access, vol. 8, pp. 161232–161244, 2020, doi: 10.1109/ACCESS.2020.3018618.
I. Espejo, R. Páez, J. Puerto, and A. M. Rodríguez-Chía, “Facility location problems on graphs with non-convex neighborhoods,” Comput. Oper. Res., vol. 159, no. June, pp. 1–14, 2023, doi: 10.1016/j.cor.2023.106356.
R. Sitepu, F. M. Puspita, I. Lestari, E. Yuliza, and S. Octarina, “Facility location problem of dynamic optimal location of hospital emergency department in Palembang,” Sci. Technol. Indones., vol. 7, no. 2, pp. 251–256, 2022.
J. F. Cordeau, F. Furini, and I. Ljubić, “Benders decomposition for very large scale partial set covering and maximal covering location problems,” Eur. J. Oper. Res., vol. 275, no. 3, pp. 882–896, 2019, doi: 10.1016/j.ejor.2018.12.021.
H. Wibowo, M. Anggraini, and R. Y. Aldino, “Pemodelan set covering problem dalam penentuan lokasi halte bus rapid transit (BRT) pada koridor rajabasa-sukaraja di kota Bandar Lampung,” Spektrum Ind., vol. 16, pp. 1–8, 2018.
B. S. Vieira et al., “A progressive hybrid set covering based algorithm for the traffic counting location problem,” Expert Syst. Appl., vol. 160, pp. 1–10, 2020, doi: 10.1016/j.eswa.2020.113641.
N. Kinsht and N. Petrunko, “Multiple partial discharge diagnostics as set covering problem,” Proc. - 2020 Int. Russ. Autom. Conf. RusAutoCon 2020, pp. 777–781, 2020, doi: 10.1109/RusAutoCon49822.2020.9208219.
Q. Xu and J. Li, “The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory,” Math. Probl. Eng., vol. 2020, pp. 22–25, 2020, doi: 10.1155/2020/5359691.
D. Idayani, Y. Puspitasari, and L. D. Ka. Sari, “Penggunaan model set covering problem dalam penentuan lokasi dan jumlah pos pemadam kebakaran,” J. Ilm. Edukasi Mat. SOULMATH, vol. 8, no. 2, pp. 139–152, 2020.
R. Sitepu, F. M. Puspita, I. S. Ariani, Indrawati, E. Yuliza, and S. Octarina, “Robust set cover problem in determining the optimal location of emergency units in Palembang city with unknown distance,” in AIP Conference Proceedings, 2023, pp. 1–6.
S. Octarina et al., “Determining the best location for COVID-19 vaccine distribution in Palembang using the set covering problem model and greedy heuristic algorithm,” Int. J. Sci. Soc., vol. 6, no. 1, pp. 389–403, 2024.
Copyright (c) 2024 Sisca Octarina, Divasanda Armalia, Bambang Suprihatin, Putra BJ Bangun, Endro Setyo Cahyono, Fitri Maya Puspita, Evi Yuliza, Indrawati Indrawati
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this Journal agree to the following terms:
- Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
- Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
- Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.
1.gif)
