Vehicle Routing Problem

Algoritma Eksak, Algoritma Aproksimasi, dan Metode Optimasi Lainnya

Authors

  • Tamara Latifah Jasmine Politeknik Rukun Abdi Luhur, Indonesia
  • Dicky Candra Ardiansyah Politeknik Rukun Abdi Luhur, Indonesia
  • Hikmah Sekarningtyas Politeknik Rukun Abdi Luhur, Indonesia
  • Rohmad Kafidzin Politeknik Rukun Abdi Luhur, Indonesia
  • Iwan Prasetyo Politeknik Rukun Abdi Luhur, Indonesia

DOI:

https://doi.org/10.31004/anthor.v5i5.1652

Keywords:

Vehicle Routing Problem, Metode Optimasi, Tinjauan Literatur Sistematis

Abstract

Vehicle Routing Problem (VRP) merupakan permasalahan optimasi kombinatorial yang berfokus pada penentuan rute optimal bagi sejumlah kendaraan untuk melayani sekumpulan titik tujuan dengan mempertimbangkan berbagai kendala operasional. Berbagai pengembangan model VRP telah dilakukan untuk mengakomodasi karakteristik permasalahan yang semakin kompleks, seperti keterbatasan kapasitas kendaraan, batasan waktu pelayanan, serta jumlah dan lokasi depot. Penelitian ini bertujuan mengidentifikasi dan mengkaji berbagai model serta metode optimasi yang digunakan dalam penyelesaian VRP melalui tinjauan literatur sistematis. Metode penyelesaian VRP secara umum dikelompokkan menjadi algoritma eksak dan algoritma aproksimasi. Algoritma eksak, seperti Integer Linear Programming (ILP) dan Mixed Integer Linear Programming (MILP), mampu menghasilkan solusi optimal, tetapi memiliki keterbatasan komputasi pada permasalahan berskala besar. Sementara itu, algoritma aproksimasi, khususnya metode heuristik dan metaheuristik seperti Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Simulated Annealing (SA), dan Tabu Search (TS), banyak digunakan untuk memperoleh solusi mendekati optimal secara lebih efisien. Selain itu, pendekatan hibrida yang mengombinasikan beberapa algoritma juga dikembangkan untuk meningkatkan kualitas solusi. Hasil kajian menunjukkan bahwa pemilihan metode penyelesaian VRP perlu disesuaikan dengan karakteristik, kompleksitas, dan tujuan optimasi permasalahan. Pengembangan metode selanjutnya perlu diarahkan pada peningkatan efisiensi komputasi serta kemampuan menghasilkan solusi optimal atau mendekati optimal untuk berbagai variasi permasalahan VRP.

References

Ahmed, Z. H., & Yousefikhoshbakht, M. (2023). A hybrid algorithm for the heterogeneous fixed fleet open vehicle routing problem with time windows. Symmetry, 15(2), Article 486. https://doi.org/10.3390/sym15020486

Asghari, M., & Al-e, S. M. J. M. (2021). Green vehicle routing problem: A state-of-the-art review. International Journal of Production Economics, 231, Article 107899. https://doi.org/10.1016/j.ijpe.2020.107899

Barati, H., Rafiee, S., Zanjirani, H., Bandi, B., Haji-Hashemi, A. M., Shafiepour, S., & Goli, A. (2025). Performance evaluation of emerging meta-heuristic algorithms on vehicle routing problem. Engineering Reports, 7(7), Article e70198. https://doi.org/10.1002/eng2.70198

Cengiz Toklu, M. (2023). A fuzzy multi-criteria approach based on Clarke and Wright savings algorithm for vehicle routing problem in humanitarian aid distribution. Journal of Intelligent Manufacturing, 34(5), 2241–2261. https://doi.org/10.1007/s10845-022-01917-0

Dereci, U., & Karabekmez, M. E. (2022). The applications of multiple route optimization heuristics and meta-heuristic algorithms to solid waste transportation: A case study in Turkey. Decision Analytics Journal, 4, Article 100113. https://doi.org/10.1016/j.dajour.2022.100113

Djebbar, A. M., & Amina, K. (2025). A hybrid approach for solving the capacitated vehicle routing problem. International Journal of Automotive Science and Technology, 9(2), 249–258. https://doi.org/10.30939/ijastech..1663305

Frías, N., Johnson, F., & Valle, C. (2023). Hybrid algorithms for energy minimizing vehicle routing problem: Integrating clusterization and ant colony optimization. IEEE Access, 11, 125800–125821. https://doi.org/10.1109/ACCESS.2023.3325787

Garside, A. K., Ahmad, R., & Muhtazaruddin, M. N. B. (2024). A recent review of solution approaches for green vehicle routing problem and its variants. Operations Research Perspectives, 12, Article 100303. https://doi.org/10.1016/j.orp.2024.100303

Ghannadpour, S. F., Zandiyeh, F., & Rahman, A. (2020). A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem. International Journal of Transportation Engineering, 7(4), 341–353.

Gruler, A., Pérez-Navarro, A., Calvet Liñan, L., & Juan, A. A. (2020). A simheuristic algorithm for time-dependent waste collection management with stochastic travel times. SORT: Statistics and Operations Research Transactions, 44(2), 285–310.

Huang, S. H., Huang, Y. H., Lee, H. C., & Tong, Y. Y. (2023). A new hybrid algorithm for solving the vehicle routing problem with route balancing. International Journal of Industrial Engineering and Management, 14(1), 51–62. https://doi.org/10.24867/IJIEM-2023-1-324

Iksan, N., Tufail, A., Apong, R. A., & Hidayatullah, A. F. (2024). Optimizing maritime passenger transfer in rich vehicle routing problem using a hybrid genetic algorithm. IEEE Access, 12, 80153–80164. https://doi.org/10.1109/ACCESS.2024.3406222

Jasmine, T. L., Putro, H. P. H., Prilandita, N., & Yudoko, G. (2025). A simulation-based metaheuristics for capacitated vehicle routing problem. Automotive Experiences, 8(1), 159–176. https://doi.org/10.31603/ae.13242

Kashyap, G. S., Brownlee, A. E., Phukan, O. C., Malik, K., & Wazir, S. (2023). Roulette-wheel selection-based PSO algorithm for solving the vehicle routing problem with time windows [Preprint]. arXiv. https://arxiv.org/abs/2306.02308

Liao, N., Lü, F., Zhang, H., & He, P. (2024). Optimizing the greenhouse gas emissions of waste transfer and transport: An integration of life cycle assessment and vehicle routing problem. Waste Management, 189, 314–324. https://doi.org/10.1016/j.wasman.2024.08.034

Liu, Q., Xu, P., Wu, Y., & Shen, T. (2022). A hybrid genetic algorithm for the electric vehicle routing problem with time windows. Control Theory and Technology, 20(2), 279–286. https://doi.org/10.1007/s11768-022-00091-1

Liu, X., Chen, Y. L., Por, L. Y., & Ku, C. S. (2023). A systematic literature review of vehicle routing problems with time windows. Sustainability, 15(15), Article 12004. https://doi.org/10.3390/su151512004

Lo, S. C. (2022). A particle swarm optimization approach to solve the vehicle routing problem with cross-docking and carbon emissions reduction in logistics management. Logistics, 6(3), Article 62. https://doi.org/10.3390/logistics6030062

Maroof, A., Ayvaz, B., & Naeem, K. (2024). Logistics optimization using hybrid genetic algorithm (HGA): A solution to the vehicle routing problem with time windows (VRPTW). IEEE Access, 12, 36974–36989. https://doi.org/10.1109/ACCESS.2024.3373699

Meniz, B., & Tiryaki, F. (2025). Genetic algorithm optimization with selection operator decider. Arabian Journal for Science and Engineering, 50(10), 6931–6941. https://doi.org/10.1007/s13369-024-09068-5

Muriyatmoko, D., Djunaidy, A., & Muklason, A. (2024). Heuristics and metaheuristics for solving capacitated vehicle routing problem: An algorithm comparison. Procedia Computer Science, 234, 494–501. https://doi.org/10.1016/j.procs.2024.03.032

Novelan, M. S., Efendi, S., Sihombing, P., & Mawengkang, H. (2023). Optimation cavacity vehicle routing problem with K-nearest neighbor in classification of goods distribution route. In 2023 International Conference of Computer Science and Information Technology (ICOSNIKOM) (pp. 1–6). IEEE. https://doi.org/10.1109/ICoSNIKOM60230.2023.10364439

Ogundoyin, S. O., & Kamil, I. A. (2021). A trust management system for fog computing services. Internet of Things, 14, Article 100382. https://doi.org/10.1016/j.iot.2021.100382

Póvoa, C. L. R., Roboredo, M. C., Velasco, A. S., Pessoa, A. A., & Paes, F. G. (2025). A hybrid GRASP and tabu-search heuristic and an exact method for a variant of the multi-compartment vehicle routing problem. Expert Systems with Applications, 259, Article 125319. https://doi.org/10.1016/j.eswa.2024.125319

Pratiwi, A. B., Salmah, S., & Endrayanto, I. (2026). A two-phase branch-and-bound algorithm for solving vehicle routing problem with maximum duration constraint. An International Journal of Optimization and Control: Theories & Applications, 16(3), 981–996. https://doi.org/10.36922/IJOCTA025480215

Qiao, Q., Tao, F., Wu, H., Yu, X., & Zhang, M. (2020). Optimization of a capacitated vehicle routing problem for sustainable municipal solid waste collection management using the PSO-TS algorithm. International Journal of Environmental Research and Public Health, 17(6), Article 2163. https://doi.org/10.3390/ijerph17062163

Reis, M. J. (2025). An adaptive hybrid metaheuristic for solving the vehicle routing problem with time windows under uncertainty. Computers, Materials & Continua, 85(2), 3023–3039. https://doi.org/10.32604/cmc.2025.066390

Sajid, M., Singh, J., & Rajak, R. (2023). Capacitated vehicle routing problem using algebraic particle swarm optimization with simulated annealing algorithm. In Artificial intelligence in cyber-physical systems (pp. 225–239). CRC Press. https://doi.org/10.1201/9781003248750-13

Sar, K., & Ghadimi, P. (2023). A systematic literature review of the vehicle routing problem in reverse logistics operations. Computers & Industrial Engineering, 177, Article 109011. https://doi.org/10.1016/j.cie.2023.109011

Simamora, H. U. U., & Rakhmawati, F. (2023). Optimization of salak fruit distribution routes with vehicle routing problem (VRP) using Clarke and Wright savings. Mathline: Jurnal Matematika dan Pendidikan Matematika, 8(2), 691–704.

Stodola, P., & Nohel, J. (2022). Adaptive ant colony optimization with node clustering for the multidepot vehicle routing problem. IEEE Transactions on Evolutionary Computation, 27(6), 1866–1880. https://doi.org/10.1109/TEVC.2022.3230042

Theurich, F., Fischer, A., & Scheithauer, G. (2021). A branch-and-bound approach for a vehicle routing problem with customer costs. EURO Journal on Computational Optimization, 9, Article 100003. https://doi.org/10.1016/j.ejco.2020.100003

Tiwari, K. V., & Sharma, S. K. (2023). An optimization model for vehicle routing problem in last-mile delivery. Expert Systems with Applications, 222, Article 119789. https://doi.org/10.1016/j.eswa.2023.119789

Wang, W., Li, Y., Yan, H., Zhao, W., Zhao, Q., & Luo, K. (2025). A two-phase algorithm for the dynamic time-dependent green vehicle routing problem in decoration waste collection. Expert Systems with Applications, 262, Article 125570. https://doi.org/10.1016/j.eswa.2024.125570

Xu, X., Wu, T., Wang, S., Zhang, S., Xu, Z., Yang, B., ... Shen, L. (2025). Optimization of reliable vehicle routing problem for medical waste collection with time windows in stochastic transportation networks. Engineering Optimization, 57(8), 2109–2139. https://doi.org/10.1080/0305215X.2024.2388626

Yu, V. F., Aloina, G., Susanto, H., Effendi, M. K., & Lin, S. W. (2022). Regional location routing problem for waste collection using hybrid genetic algorithm-simulated annealing. Mathematics, 10(12), Article 2131. https://doi.org/10.3390/math10122131

Yu, V. F., Lin, C. H., Maglasang, R. S., Lin, S. W., & Chen, K. F. (2024). An efficient simulated annealing algorithm for the vehicle routing problem in omnichannel distribution. Mathematics, 12(23), Article 3664. https://doi.org/10.3390/math12233664

Zhang, H., Ge, H., Yang, J., & Tong, Y. (2022). Review of vehicle routing problems: Models, classification and solving algorithms. Archives of Computational Methods in Engineering, 29(1), 195–221. https://doi.org/10.1007/s11831-021-09574-x

Downloads

Published

2026-10-31

How to Cite

Jasmine, T. L., Ardiansyah, D. C., Sekarningtyas, H., Kafidzin, R., & Prasetyo, I. (2026). Vehicle Routing Problem: Algoritma Eksak, Algoritma Aproksimasi, dan Metode Optimasi Lainnya. ANTHOR: Education and Learning Journal, 5(5), 2025–2033. https://doi.org/10.31004/anthor.v5i5.1652

Issue

Section

Articles

Similar Articles

<< < 61 62 63 64 65 66 67 68 69 70 > >> 

You may also start an advanced similarity search for this article.