Determination of Distribution Center Location using Analysis of Time-Based Set Covering Model and Maximal Covering Model Analysis

Authors

  • Rainisa Maini Heryanto Program Studi Teknik Industri, Universitas Kristen Maranatha
  • Santoso Santoso Program Studi Teknik Industri, Universitas Kristen Maranatha http://orcid.org/0000-0002-0244-4372

DOI:

https://doi.org/10.31315/opsi.v16i1.8760

Keywords:

distribution center, location, Maximal Covering Model, Set Covering Model, time

Abstract

The distribution or delivery process is one factor that affect customer satisfaction as the goal of supply chain. In order for supply chain to be competitive in competition, delivery time is an important factor to manage, so that it could provide high service level value. One factor that could affects distribution or delivery is distribution center location. A strategic distribution center location would facilitate and speed up distribution process. This research discusses model for determining location of distribution center so that delivery could be made at the right amount and in the right time by analyzing of time-based using set covering model and maximal covering model. The numerical example in this research is case study on paint supply chain in Bandung which has a number of delivering clusters. Each cluster consists of a number of building material stores which are located scattered. There is one cluster that has problems in fulfilling demands and delivery times. The analysis made could be used to determine the distribution center location so that it could serve all consumer demands. Based on the calculation results, it was found that there were two distribution center locations. Two distribution centers could fulfill the objective function of cost minimization and satisfy all demands. The results of the sensitivity analysis show that there are several factors that influence the determination of location number.

References

Bahrami, I., Ahari, R. M., & Asadpour, M. (2021). A maximal covering facility location model for emergency services within an M(t)/M/m/m queuing system. Journal of Modelling in Management, 16(3), 963–986. https://doi.org/10.1108/JM2-06-2020-0152

Bangun, P. B. J., Octarina, S., Aniza, R., Hanum, L., Puspita, F. M., & Supadi, S. S. (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. https://doi.org/10.26554/sti.2022.7.1.98-105

Church, R., & Velle, C. R. (2005). The Maximal Covering Location Problem. Papers in Regional Science, 32(1), 101–118. https://doi.org/10.1111/j.1435-5597.1974.tb00902.x

Daskin, M. S. (1995). Network and Discrete Location Models, Algorithms, and Applications (R. L. Graham, J. K. Lenstra, & R. E. Tarjan, Eds.). John Wiley & Sons, Inc.

Doungpan, S. (2020). Analysis of Covering Problem Models for Setting the Location of a Ready-Mixed Concrete Plant: Case Study of the Rayong Province, Thailand. IOP Conference Series: Materials Science and Engineering, 012003. https://doi.org/10.1088/1757-899X/910/1/012003

Idayani, D., Puspitasari, Y., & Sari, L. D. K. (2020). Penggunaan Model Set Covering Problem dalam Penentuan Lokasi dan Jumlah Pos Pemadam Kebakaran. Jurnal Ilmiah Soulmath : Jurnal Edukasi Pendidikan Matematika, 8(2), 139–152. https://doi.org/10.25139/smj.v8i2.3280

Kumar, R., Ganapathy, L., Gokhale, R., & Tiwari, M. K. (2020). Quantitative approaches for the integration of production and distribution planning in the supply chain: a systematic literature review. In International Journal of Production Research (Vol. 58, Issue 11, pp. 3527–3553). Taylor and Francis Ltd. https://doi.org/10.1080/00207543.2020.1762019

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

Pujawan, I. N., & Er, M. (2017). Supply Chain Management (3rd ed.). Penerbit ANDI.

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

Santoso, S., & Heryanto, R. M. (2022). Pengembangan Model Capacitated Maximal Covering Location Problem (CMCLP) untuk Penentuan Lokasi dan Tipe Distribution Center. OPSI, 15(1), 34. https://doi.org/10.31315/opsi.v15i1.6431

Sourirajan, K., Ozsen, L., & Uzsoy, R. (2009). A genetic algorithm for a single product network design model with lead time and safety stock considerations. European Journal of Operational Research, 197(2), 599–608. https://doi.org/10.1016/j.ejor.2008.07.038

Toregas, C., Swain, R., ReVelle, C., & Bergman, L. (1971). The Location of Emergency Service Facilities. Operations Research, 19(6), 1363–1373. https://doi.org/10.1287/opre.19.6.1363

Downloads

Published

2023-06-19

Issue

Vol. 16 No. 1 (2023): ISSN 1693-2102

Section

Article

License

Authors who publish articles in this journal agree to the following conditions:

  1. 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.
  2. 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.
  3. 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)
 

Lisensi Creative Commons

This work is Licensed Under a Creative Commons Attribution 4.0 International license.