Perancangan Rute Distribusi Air Minum Dalam Kemasan dengan Capacitated Vehicle Routing Problem
DOI:
https://doi.org/10.30587/matrik.v23i2.4366Keywords:
Capacitated Vehicle Routing Problem (CVRP), Air Minum Dalam Kemasan (AMDK), Branch and BoundAbstract
Perusahaan distributor Air Minum Dalam Kemasan (AMDK) yang berlokasi di Semarang memiliki dua kendaraan untuk melakukan distribusi ke 16 lokasi distribusi di dalam Semarang. Permasalahan yang dihadapi yaitu perusahaan melakukan distribusi tanpa memperhitungkan jarak tempuh, kuantitas permintaan yang berbeda-beda di setiap lokasi, keterbatasan jumlah dan kapasitas kendaraan, serta lokasi pelanggan yang tersebar di Semarang. Penelitian perlu dilakukan dengan menggunakan Capacitated Vehicle Routing Problem (CVRP) untuk mendapatkan rute distribusi dengan jarak dan waktu tempuh distribusi optimal. Penelitian ini menggunakan pendekatan Mixed Integer Linear Programming (MILP) dengan metode Branch and Bound. Model matematika dibuat dan diterjemahkan ke dalam bahasa pemrograman LINGO untuk dijalankan dan menghasilkan rute optimal. Hasil pada penelitian ini yaitu didapatkan dua rute optimal untuk setiap kendaraan 1 dan 2 melakukan distribusi AMDK ke 16 lokasi. Jumlah muatan juga didapatkan untuk masing-masing rute dengan tidak melebihi kapasitas kendaraan. Total jarak yang ditempuh berkurang sebesar 28% dan dapat menghemat total waktu tempuh sebesar 11%. Analisis sensitivitas dilakukan dengan mengubah parameter permintaan dan hasilnya yaitu terjadi penambahan rute menjadi 3 rute ketika kondisi kenaikan permintaan sebesar 5%, 10%, dan 15% serta terdapat pengaruh perubahan pada rute, jarak, dan waktu tempuh ketika kondisi penurunan permintaan 15% serta kondisi kenaikan permintaan 5%, 10%, dan 15%.
References
[2] A. Aguirre, M. Coccola, M. Zamarripa, C. Méndez, and A. Espuña, A robust MILP-based approach to vehicle routing problems with uncertain demands, vol. 29. 2011. doi: 10.1016/B978-0-444-53711-9.50127-9.
[3] E. Castillo, R. Mínguez, and C. Castillo, “Sensitivity analysis in optimization and reliability problems,” Reliab Eng Syst Saf, vol. 93, no. 12, 2008, doi: 10.1016/j.ress.2008.03.010.
[4] F. Stavropoulou, “The Consistent Vehicle Routing Problem with heterogeneous fleet,” Comput Oper Res, vol. 140, 2022, doi: 10.1016/j.cor.2021.105644.
[5] F. Theurich, A. Fischer, and G. Scheithauer, “A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs,” EURO Journal on Computational Optimization, vol. 9, 2021, doi: 10.1016/j.ejco.2020.100003.
[6] I. Kantor, J. L. Robineau, H. Bütün, and F. Maréchal, “A Mixed-Integer Linear Programming Formulation for Optimizing Multi-Scale Material and Energy Integration,” Front Energy Res, vol. 8, 2020, doi: 10.3389/fenrg.2020.00049.
[7] M. A. Takan and R. Kasimbeyii, “MULTIOBJECTIVE MATHEMATICAL MODELS AND SOLUTION APPROACHES FOR HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEMS,” Journal of Industrial and Management Optimization, vol. 17, no. 4, 2021, doi: 10.3934/jimo.2020059.
[8] N. A. Kyriakakis, I. Sevastopoulos, M. Marinaki, and Y. Marinakis, “A hybrid Tabu search – Variable neighborhood descent algorithm for the cumulative capacitated vehicle routing problem with time windows in humanitarian applications,” Comput Ind Eng, vol. 164, 2022, doi: 10.1016/j.cie.2021.107868.
[9] N. Giedelmann-L, W. J. Guerrero, and E. L. Solano-Charris, “On the Emergency Water Distribution Problem: Optimizing Vehicle Routing Decisions with Deprivation Costs Considerations,” IFAC-PapersOnLine, vol. 55, no. 10, pp. 3166–3171, Jan. 2022, doi: 10.1016/J.IFACOL.2022.10.216.
[10] P. Sitek, J. Wikarek, K. Rutczyńska-Wdowiak, G. Bocewicz, and Z. Banaszak, “Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach,” Neurocomputing, vol. 423, 2021, doi: 10.1016/j.neucom.2020.02.126.
[11] S. Allahyari, S. Yaghoubi, and T. van Woensel, “The secure time-dependent vehicle routing problem with uncertain demands,” Comput Oper Res, vol. 131, 2021, doi: 10.1016/j.cor.2021.105253.
[12] S. K. Sharma, S. Routroy, and U. Yadav, “Vehicle routing problem: Recent literature review of its variants,” International Journal of Operational Research, vol. 33, no. 1. 2018. doi: 10.1504/IJOR.2018.094229.
[13] V. S. Nguyen, Q. D. Pham, T. H. Nguyen, and Q. T. Bui, “Modeling and solving a multi-trip multi-distribution center vehicle routing problem with lower-bound capacity constraints,” Comput Ind Eng, vol. 172, p. 108597, Oct. 2022, doi: 10.1016/J.CIE.2022.108597.
[14] X. Zhang, L. Chen, M. Gendreau, and A. Langevin, “A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints,” Eur J Oper Res, vol. 302, no. 1, 2022, doi: 10.1016/j.ejor.2021.12.050.
[15] Y. Chen, D. Li, Z. Zhang, M. I. M. Wahab, and Y. Jiang, “Solving the battery swap station location-routing problem with a mixed fleet of electric and conventional vehicles using a heuristic branch-and-price algorithm with an adaptive selection scheme,” Expert Syst Appl, vol. 186, 2021, doi: 10.1016/j.eswa.2021.115683.
[16] Y. Hartono, F. M. Puspita, D. I. Permatasari, and B. Arisha, “LINGO-based on robust counterpart open capacitated vehicle routing problem (RC-OCVRP) model of waste transportation in Palembang,” in 2018 International Conference on Information and Communications Technology, ICOIACT 2018, 2018, vol. 2018-January. doi: 10.1109/ICOIACT.2018.8350689.
