Determining Book Distribution Routes by Implementing Vehicle Routing Problems Using Excel Solver at Gunadarma University
DOI:
https://doi.org/10.62872/dt01s735Keywords:
Distribution route , Excel Solver, Nearest Neighbor, Vehicle Routing ProblemAbstract
Gunadarma University operates multiple campuses, each equipped with its own library. To ensure equitable access to newly acquired titles, it is imperative that these materials are disseminated across all campus libraries. So, when a new book title is added, this book must also be owned by the library at each campus location. In this research, book distribution routes with the shortest distance and time will be determined using the Vehicle Routing Problem (VRP) method with Excel Solver. Gunadarma University has a central library which is the starting point for distributing books to other campuses. The central university library serves as the distribution hub, from which books are dispatched to seven additional campus locations. Simulation results using Excel Solver showed that the shortest route for sending books to seven library locations on the Gunadarma University campus using one vehicle was a distance of 137.14 km in 3 hours 12 minutes. This optimized route yielded substantial cost savings, amounting to a 12.5% reduction compared to previous distribution practices.
References
Braekers, K., K. Ramaekers, and I. Van Nieuwenhuyse, The vehicle routing problem: State of the art classification and review. Computers industrial engineering, 2016. 99: p. 300-313.
Caceres-Cruz, J., et al., Rich vehicle routing problem: Survey. ACM Computing Surveys, 2014. 47(2): p. 1-28.
Duan, L., et al. Efficiently solving the practical vehicle routing problem: A novel joint learning approach. in Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining. 2020.
Fernstrøm, F.S., Teresa Anna A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands. Information Processing Letters, 2020. 159: p. 105960.
Elshaer, R. and H. Awad, A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Computers Industrial Engineering 2020. 140: p. 106242.
Fernstrøm, F.S., Teresa Anna A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands. Information Processing Letters, 2020. 159: p. 105960.
Elshaer, R. and H. Awad, A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Computers Industrial Engineering 2020. 140: p. 106242.
Erdoğan, G., An open source spreadsheet solver for vehicle routing problems. Computers operations research, 2017. 84: p. 62-72.
Güneri, A., Physical distribution activities and vehicle routing problems in logistics management: a case study. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2007. 221(1): p. 123-133.
Hadhiatma, A. and A. Purbo, Vehicle Routing Problem untuk Distribusi Barang Menggunakan Algoritma Semut. Prosiding SNATIF, 2017: p. 139-145.
Konstantakopoulos, G.D., S.P. Gayialis, and E.P. Kechagias, Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification. Operational research, 2020: p. 1-30.
Kucukoglu, I., R. Dewil, and D. Cattrysse, The electric vehicle routing problem and its variations: A literature review. Computers Industrial Engineering, 2021. 161: p. 107650.
Liao, T.-Y. and T.-Y. Hu, An object-oriented evaluation framework for dynamic vehicle routing problems under real-time information. Expert Systems with Applications, 2011. 38(10): p. 12548-12558.
Lubis, H.A.R., A. Maulana, and R.B. Frazila, Penerapan Konsep Vehicle Routing Problem dalam Kasus Pengangkutan Sampah di Perkotaan. Jurnal Teknik Sipil ITB, 2016. 23(3): p. 213-222.
Pan, B., Z. Zhang, and A. Lim, Multi-trip time-dependent vehicle routing problem with time windows. European Journal of Operational Research, 2021. 291(1): p. 218-231.
Pasha, J., et al., An optimization model and solution algorithms for the vehicle routing problem with a “factory-in-a-box”. IEEE Access 2020. 8: p. 134743-134763.
Saraswati, R., W. Sutopo, and M. Hisjam, Penyelesaian capacitated vechile routing problem dengan menggunakan algoritma sweep untuk penentuan rute distribusi koran: Studi kasus. Jurnal Manajemen Pemasaran, 2017. 11(2): p. 41-44.
Souza, J.F.d. and V. Pureza, Modeling and solving a rich vehicle routing problem for the delivery of goods in urban areas. Pesquisa Operacional, 2016. 36(3): p. 421-446.
Tan, S.-Y. and W.-C. Yeh, The vehicle routing problem: State-of-the-art classification and review. Applied Sciences, 2021. 11(21): p. 10295.
Wang, C.-H. and J.-Z. Lu, A hybrid genetic algorithm that optimizes capacitated vehicle routing problems. Expert Systems with Applications, 2009. 36(2): p. 2921-2936.
Zhou, F., et al., Capacitated disassembly scheduling with random demand and operation time. Journal of the Operational Research Society, 2022. 73(6): p. 1362-1378.
Zhang, H., et al., Review of vehicle routing problems: Models, classification and solving algorithms. Archives of Computational Methods in Engineering, 2022: p. 1-27.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Maulida Boru Butar Butar (Author)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
