Pengembangan Model Masalah Set Covering Problem untuk Menentukan Lokasi Pontensial SPBU (Studi Kasus: Kota Tangerang Selatan)

Authors

  • Ronald Sukwadi Program Studi Program Profesi Insinyur, Fakultas Biosains, Teknologi, dan Inovasi, Universitas Katolik Indonesia Atma Jaya,
  • Agustinus Silalahi Program Studi Teknik Industri, Fakultas Biosains, Teknologi, dan Inovasi, Universitas Katolik Indonesia Atma Jaya
  • Hans Louis Olinger Department of Industrial & Systems Engineering, Chung Yuan Christian University
  • Hsiang-Ling Chen Department of Industrial & Systems Engineering, Chung Yuan Christian University
  • Trifenaus Prabu Hidayat Program Studi Program Profesi Insinyur, Fakultas Biosains, Teknologi, dan Inovasi, Universitas Katolik Indonesia Atma Jaya
  • Sandra Oktaviani Program Studi Program Teknik Elektro, Fakultas Biosains, Teknologi, dan Inovasi, Universitas Katolik Indonesia Atma Jaya

DOI:

https://doi.org/10.25170/jpk.v3i04.8003

Keywords:

IBM ILOG CPLEX, Objective Function, Decision Variables, Distance, SPBU

Abstract

This study utilises IBM ILOG CPLEX to solve the set covering problem. The model is designed to minimise the total coverage distance whilst maximising the number of demand points in South Tangerang. Constraints were set to ensure that petrol stations are assigned as both intra-cluster and inter-cluster stations. Data was collected using Google Maps and recorded in an Excel spreadsheet. The final results show the decision variables for AssignIntra, AssignInter and Route. The objective function minimises distance and maximises demand coverage. The global optimal solution covers the entire South Tangerang area with petrol stations, thereby eliminating unnecessary petrol stations. Maps and cluster analysis were used to identify redundant petrol stations for elimination. The computation time was recorded at 14.18 seconds, and verification and validation processes were carried out. The validated results show a total distance of 115.99 km.

References

Aleisa, E., Savsar, M., Al-Mashaan, M. M., Al-Jadi, A., & Al-Sabah, S. A. (2014). A metaheuristic approach for location of gas stations in a metropolitan area. International Journal of Operational Research, 21(2), 172-200.

Argun, I. D. (2019). An overview on set covering problems with a focus on military applications. Operations Research for Military Organizations, 54-66.

Badan Pusat Statistik (2023). “Badan Pusat Statistik Kota Tangerang Selatan.” (https://tangselkota.bps.go.id/indicator/12/85/1/jumlah-penduduk.html). Diakses tanggal 27 Juli 2023).

Badan Pusat Statistik (2023). “BPS Provinsi Banten.” (https://banten.bps.go.id/indicator/17/308/1/jumlah-kendaraan-bermotor-menurut-kabupaten-kota-dan-jenis-kendaraan-di-provinsi-banten.html). Diakses tanggal 27 Juli 2023.

Badan Pusat Statistik (2023). “Badan Pusat Statistik Kota Tangerang Selatan.” (https://tangselkota.bps.go.id/). Diakses tanggal 27 Juli 2023.

Başar, A., Kabak, Ö., Topçu, Y. İ., & Bozkaya, B. (2015). Location analysis in banking: a new methodology and application for a Turkish bank. In Applications of location analysis (pp. 25-54). Cham: Springer International Publishing.

Bantenprov (2023). “Geografi - Profil Provinsi,” Website Resmi Pemerintah Provinsi Banten. (https://bantenprov.go.id/geografi). Diakses tanggal 27 Juli 2023.

CNBCIndonesia (2023). “Sah! Indonesia Kini Punya 38 Provinsi, Ini Daftar Lengkapnya.” (https://www.cnbcindonesia.com/news/20221117192559-4-389088/sah-indonesia-kini-punya-38-provinsi-ini-daftar-lengkapnya). Diakses tanggal 27 Juli 2023.

Crawford, B., Soto, R., Cuesta, R., & Paredes, F. (2014). Application of the artificial bee colony algorithm for solving the set covering problem. The Scientific World Journal, 2014(1), 189164.

Crawford, B., Soto, R., Monfroy, E., Astorga, G., García, J., & Cortes, E. (2018). A meta-optimization approach to solve the set covering problem. Ingeniería, 23(3), 274-288.

Degel, D., & Lutter, P. (2013). A robust formulation of the uncertain set covering problem. https://optimization-online.org/2013/06/3926/ Diakses tanggal 27 Juli 2023.

Drakulić, D., Takači, A., & Marić, M. (2016). Solving minimal covering location problems with single and multiple node coverage. Scientific Bulletin of the Petru Maior University of Targu Mures, 13(2), 34-38.

Farahani, R. Z., Hekmatfar, M., Fahimnia, B., & Kazemzadeh, N. (2014). Hierarchical facility location problem: Models, classifications, techniques, and applications. Computers & Industrial Engineering, 68, 104-117.

Nickel, S., Steinhardt, C., Schlenker, H., & Burkart, W. (2022). Decision optimization with IBM ILOG CPLEX optimization studio. Angewandte Optimierung mit IBM ILOG CPLEX Optimization Studio; Springer: Berlin/Heidelberg, Germany. (Tidak ada dalam Sitasi)

Wang, S. P., Lee, H. C., & Hsieh, Y. K. (2016). A Multicriteria Approach for the Optimal Location of Gasoline Stations Being Transformed as Self‐Service in Taiwan. Mathematical Problems in Engineering, 2016(1), 8341617.

Welch, S. B., & Salhi, S. (1997). The obnoxious p facility network location problem with facility interaction. European Journal of Operational Research, 102(2), 302-319.

Downloads

Published

2026-07-06