Development of the Capacitated Maximal Covering Location Problem (CMCLP) Model in Determining the Location and Type of Distribution Center
DOI:
https://doi.org/10.31315/opsi.v15i1.6431Keywords:
available budget, capacitated maximal covering location problem (CMCLP), facility location, mixed integer linear programming (MILP), type of distribution centerAbstract
Facility location decision making is necessary for both the public and private sectors for optimum utilization of resources. While the private sector may locate facilities to maximize profit or minimize cost, the public sector aims at providing services to cover as many in the population as possible. In this research, a Capacitated Maximal Covering Location problem (CMCLP) with constraints in actual world such as various types of facilities and consider maximum available budget to build the facilities. An Mixed Integer Linear Programming (MILP) model is constructed in order to find the optimal solution. The problem to be solved is determining the strategic location for establishment of a Distribution Center (DC) that maximize number of demands that can be fulfilled. A numerical example in the previous study will be used and solved using MATLAB 9.0. From the development model, the company finds the optimal location to build a DC and knows the number of products allocated from DC to each demand point and the maximum number of demands that could be fulfilled as in the previous study. The company also could find out the type of DC to be built and of course meet the available budget to build the DC.
References
Adesina, E. A., Odumosu, J. O., Morenikeji, O. O., Umoru, E., Ayokanmbi, A. O., & Ogunbode, E. B. (2017). Optimization of fire stations services in Minna metropolis using maximum covering location model (MCLM). Journal of Applied Sciences & Environmental Sustainability, 3(7), 172–187. https://www.jases.org/wp-content/uploads/2017/08/EES_014.pdf
Amarilies, Harummi S., Kamil, A. P., Adzkia, H. F., & Redi, A. A. N. P. (2020). Maximum Coverage Distance Problem for Dockless Bike Sharing System. 306–309. https://doi.org/10.1145/3383845.3383893
Amarilies, Harummi Sekar, Perwira Redi, A. A. N., Mufidah, I., & Nadlifatin, R. (2020). Greedy Heuristics for the Maximum Covering Location Problem: A case study of Optimal Trashcan Location in Kampung Cipare-Tenjo-West Java. IOP Conference Series: Materials Science and Engineering, 847(1). https://doi.org/10.1088/1757-899X/847/1/012007
Bagherinejad, J., & Shoeib, M. (2018). Dynamic capacitated maximal covering location problem by considering dynamic capacity. International Journal of Industrial Engineering Computations, 9(2), 249–264. https://doi.org/10.5267/j.ijiec.2017.5.004
Correia, I., & Captivo, M. E. (2003). A Lagrangean Heuristic for a Modular Capacitated Location Problem. Annals of Operations Research, 122(1–4), 141–161. https://doi.org/10.1023/A:1026146507143
Gazani, M. H., Akhavan Niaki, S. A., & Akhavan Niaki, S. T. (2020). The capacitated maximal covering location problem with heterogeneous facilities and vehicles and different setup costs: An effective heuristic approach. International Journal of Industrial Engineering Computations, 12(1), 79–90. https://doi.org/10.5267/j.ijiec.2020.9.002
Haghani, A. (1996). Capacitated maximum covering location models: Formulations and solution procedures. Journal of Advanced Transportation, 30(3), 101–136. https://doi.org/10.1002/atr.5670300308
Hashim, N. M., Shariff, S. S. R., & Deni, S. M. (2017). Capacitated maximal covering location allocation problem during flood disaster. Advanced Science Letters, 23(11), 11545–11548. https://doi.org/10.1166/asl.2017.10325
Høie, E. B. (2018). Maximum Covering Location Approach for Solving a Coast Guard Deployment Problem Emil Benthien Høie. June.
Nantomah, K. K., & Twum, S. B. (2017). Health Facility Siting Plans Approached as Maximum Covering Location Problems. 3(4), 50–58.
Olivia, A., Sekar, H., & Lusiani, M. (2020). Analisis Penempatan Regulator Sector Jaringan Gas Rumah Tangga Berdasarkan Maximum Coverage Location Problem (Case Study: Jaringan Gas Rumah Tangga Kota Depok, Jawa Barat). Jurnal Logistik Indonesia, 5(1), 24–33. https://doi.org/10.31334/logistik.v5i1.1182
Owen, S. H., & Daskin, M. S. (1998). Strategic facility location: A review. European Journal of Operational Research, 111(3), 423–447. https://doi.org/10.1016/S0377-2217(98)00186-6
Pirkul, H., & Schilling, D. A. (1991). The Maximal Covering Location Problem with Capacities on Total Workload. Management Science, 37(2), 233–248. https://doi.org/10.1287/mnsc.37.2.233
Salari, M. (2014). An Iterated Local Search for the Budget Constrained Generalized Maximal Covering Location Problem. Journal of Mathematical Modelling and Algorithms in Operations Research, 13(3), 301–313. https://doi.org/10.1007/s10852-013-9233-9
Shariff, S. S. R., Moin, N. H., & Omar, M. (2012). Location allocation modeling for healthcare facility planning in Malaysia. Computers and Industrial Engineering, 62(4), 1000–1010. https://doi.org/10.1016/j.cie.2011.12.026
Taiwo, O. J., & Orunmuyi, A. T. (2021). Maximal covering location problem for nuclear medicine clinics allocation in Nigeria. Spatial Information Research, 29(6), 919–935. https://doi.org/10.1007/s41324-021-00405-6
Wati, P. E. D. K., & Nuha, H. (2018). Pengembangan Model Capacitated Maximal Covering Location Problem (CMCLP) Dalam Penentuan Lokasi Pendirian Gudang. Jurnal Teknik Industri, 19(1), 21. https://doi.org/10.22219/jtiumm.vol19.no1.23-29
Yin, P., & Mu, L. (2012). Modular capacitated maximal covering location problem for the optimal siting of emergency vehicles. Applied Geography, 34, 247–254. https://doi.org/10.1016/j.apgeog.2011.11.013
Zarandi, M. H. F., Davari, S., & Sisakht, S. A. H. (2013). The large-scale dynamic maximal covering location problem. Mathematical and Computer Modelling, 57(3–4), 710–719. https://doi.org/10.1016/j.mcm.2012.07.028
Downloads
Published
Issue
Section
License
Authors who publish articles in this journal agree to the following conditions:
- Copyright remains with the author and gives the Opsi journal the right as a priority to publish its articles with Creative Commons Attribution 4.0 International license. Which allows articles to be shared with acknowledgement of the author of the article and this journal as the place of publication.
- Authors can distribute their articles on a non-exclusive basis (e.g. in university repositories or books) with notification or acknowledgement of publication in Opsi journals.
- Authors are allowed to post their work online (e.g. on a personal website or in a university repository) before and after the submission process (see The Effect of Open Access)
This work is Licensed Under a Creative Commons Attribution 4.0 International license.