Route Optimization for Open Vehicle Routing Problem (OVRP): A Mathematical and Solution Approach
Source abstract
Abstract
In the everchanging landscape of human mobility and commerce, efficient route planning has become paramount. This paper addresses the open vehicle routing problem (OVRP), a major logistical challenge in route optimization for a fleet of vehicles serving geographically dispersed customers. Using a heuristic approach, we explore the complexities of OVRP, comparing the results with advanced optimization methods. This study not only highlights the effectiveness of mathematical modeling, but also explores the practicality of heuristic algorithms such as Greedy, Nearest Neighbor and 2-opt to provide quality solutions. The findings highlight the nuanced interplay between solution quality and computational efficiency, providing valuable insights for addressing real-world logistics challenges. Recommendations delve into optimization opportunities and the integration of emerging technologies, ensuring adaptable solutions to the intricate the problem of open vehicle routing.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Vehicle Routing Optimization Methods · Transportation and Mobility Innovations · Smart Parking Systems Research
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Faculty of Engineering, Universidad Andres Bello, Santiago 8320000, Chile
Industrial Engineering School, Universidad del Sinú, Cartagena 130001, Colombia
Department of Industrial Engineering, Universidad del Bío-Bío, Concepción 4030000, Chile
Department of Productivity and Innovation, Universidad de la Costa, Barranquilla 080001, Colombia
Funding
projects UBIOBIO GI 2380142 · UBIOBIO 2260222 IF/R · ANID FONDECYT REGULAR 1230125
References (32)
Show source-provided references
1. Solution of a large-scale traveling-salesman problem
2. Toth, P., and Vigo, D. (2014). Vehicle Routing: Problems, Methods, and Applications, Society for Industrial and Applied Mathematics.10.1137/1.9781611973594 ↗
3. Morillo, D., and Gatica, G. (2022). Learn by Modeling: Integer-Mixed Linear Programming: Learning Guide, from Problem to Solution with AMPL, Sello Editorial Javeriano-Pontificia Universidad Javeriana.
4. Ge, H., Zhen, T., Jiang, Y., and Che, Y. (2010). An intelligent solution for open vehicle routing problem in grain logistics. Advances in Wireless Networks and Information Systems, Springer.10.1007/978-3-642-14350-2_49 ↗
5. A deterministic iterated local search algorithm for the vehicle routing problem with backhauls10.1007/s11750-015-0404-x ↗
6. Applegate, D.L., Bixby, R.E., Chvátal, V., and Cook, W.J. (2007). The Traveling Salesman Problem: A Computational Study, Princeton University Press.
7. Kallrath, J. (2004). Modeling Languages in Mathematical Optimization, Springer Science & Business Media.10.1007/978-1-4613-0215-5 ↗
8. Zhang, Y., Li, H., Wang, Z., and Wang, H. (2024). A Multi-Objective Learning Whale Optimization Algorithm for Open Vehicle Routing Problem with Two-Dimensional Loading Constraints. Mathematics, 12.10.3390/math12050731 ↗
9. Fixed fleet open vehicle routing problem: Mathematical model and a modified ant colony optimization. Bulletin of the Polish Academy of Sciences
10. An improved tabu search algorithm for solving heterogeneous fixed fleet open vehicle routing problem with time windows10.1016/j.aej.2022.09.008 ↗
11. A variable neighborhood search for Open Vehicle Routing Problem10.1002/cpe.7598 ↗
12. Ahmed, Z.H., and Yousefikhoshbakht, M. (2023). A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows. Symmetry, 15.10.3390/sym15020486 ↗
13. Multi-objective medical supplies distribution open vehicle routing problem with fairness and timeliness under major public health emergencies10.1007/s44176-023-00015-6 ↗
14. A hybrid multi-objective evolutionary algorithm for open vehicle routing problem through cluster primary-route secondary approach
15. A multi-objective open vehicle routing problem with overbooking: Exact and heuristic solution approaches for an employee transportation problem10.1016/j.omega.2021.102587 ↗
16. Open vehicle routing problem with split deliveries: Mathematical formulations and a cutting-plane method
17. The Two Echelon Open Vehicle Routing Problem: Optimization of Crowdshipping Based Parcel Delivery10.1007/s12205-022-1948-6 ↗
18. Öztop, H. (2022). A constraint programming model for the open vehicle routing problem with heterogeneous vehicle fleet. The International Symposium for Production Research, Springer International Publishing.10.1007/978-3-031-24457-5_27 ↗
19. Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem10.1007/s12065-023-00898-0 ↗
20. Xiao, S., Peng, P., Zheng, P., and Wu, Z. (2024). A Hybrid Adaptive Simulated Annealing and Tempering Algorithm for Solving the Half-Open Multi-Depot Vehicle Routing Problem. Mathematics, 12.10.3390/math12070947 ↗
21. A general VNS for the multi-depot open vehicle routing problem with time windows10.1007/s11590-023-01990-1 ↗
22. A hybridization of granular adaptive tabu search with path relinking for the multi-depot open vehicle routing problem10.1016/j.eij.2023.100420 ↗
23. On the exact solution of the multi-depot open vehicle routing problem10.1007/s11590-023-02072-y ↗
24. Du, M. (2023, January 10–12). Improved Ant Colony Algorithm for Solving multi-deport Open Vehicle Routing Problem with Fuzzy Time Window. Proceedings of the 2023 3rd International Conference on Digital Society and Intelligent Systems (DSInS), Chengdu, China.10.1109/DSInS60115.2023.10455333 ↗
25. Boyd, S.P., and Vandenberghe, L. (2004). Convex Optimization, Cambridge University Press.10.1017/CBO9780511804441 ↗
26. Fourer, R., Gay, D.M., and Kernighan, B.W. (2003). AMPL: A Modeling Language for Mathematical Programming, Thomson/Brooks Cole.
27. Sumbal, M.S., Ahmed, W., Shahzeb, H., and Chan, F. (2023). Sustainable Technology Strategies for Transportation and Logistics Challenges: An Implementation Feasibility Study. Sustainability, 15.10.3390/su152115224 ↗
28. Computer Solutions of the Traveling Salesman Problem10.1002/j.1538-7305.1965.tb04146.x ↗
29. A metaheuristic for the double traveling salesman problem with partial last-in-first-out loading constraints10.1111/itor.13189 ↗
30. Research on Single and Mixed Fleet Strategy for Open Vehicle Routing Problem10.4304/jsw.6.10.2076-2081 ↗
31. Uddin, F., Riaz, N., Manan, A., Mahmood, I., Song, O.Y., Malik, A.J., and Abbasi, A.A. (2023). An improvement to the 2-opt heuristic algorithm for approximation of optimal TSP tour. Appl. Sci., 13.10.3390/app13127339 ↗
32. Review of vehicle routing problems solving software10.17981/ingecuc.17.1.2021.23 ↗