Abstract
This paper studies the open vehicle routing problem (OVRP), in which the vehicles do not return to the starting depot after serving the last customers or, if they do, they must make the same trip in the reverse order. We present an ant colony system hybridized with local search for solving the OVRP (ACS-OVRP). Additionally, a Post-Optimization procedure is incorporated in the proposed algorithm to further improve the best-found solutions. The computational results of ACS-OVRP compared to those of other algorithms are reported, which indicate that the ACS-OVRP is another efficient algorithm for solving the OVRP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Li, F., Golden, B., Wasil, E.: The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers and Operations Research (in press)
Schrage, L.: Formulation and structure of more complex realistic routing and scheduling problem. Networks 11, 229–232 (1981)
Sariklis, D., Powell, S.: A heuristic method for the open vehicle routing problem. The Journal of the Operational Research Society 51(5), 564–573 (2000)
Brãndao, J.: A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research 157(3), 552–564 (2004)
Fu, Z., Eglese, R., Li, L.: A new tabu search heuristic for the open vehicle routing problem. Journal of the Opeartional Research Society 56(2), 267–274 (2005)
Tarantilis, C., Diakoulaki, D., Kiranoudis, C.: Combination of geographical infromation system and efficient routing algorithms for real life distribution operations. European Journal of Opeartions Research 152(2), 437–453 (2004)
Tarantilis, C., Ioannou, G., Kiranoudis, C., Prastacos, G.: Solving the open vehicle routing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society 56, 588–596 (2005)
Li, F., Golden, B., Wasil, E.: Very large-scale vehicle routing: new test problems, algorithms, and results. Computers and Operations Research 32(5), 1165–1179 (2005)
Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press, Massachusetts (2004)
Potvin, P., Rousseau, J.: An exchange heuristic for routing problem with time windows. Journal of the Operational Research Society 46, 1433–1446 (1995)
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial optimization, pp. 315–338. Wiley, Chichester (1979)
Tarantilis, C., Ioannou, G., Kiranoudis, C., Prastacos, G.: A threshold accepting approach for the open vehicle routing. RAIRO Opeartions Research 38, 345–360 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Tian, P. (2006). An Ant Colony System for the Open Vehicle Routing Problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_33
Download citation
DOI: https://doi.org/10.1007/11839088_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38482-3
Online ISBN: 978-3-540-38483-0
eBook Packages: Computer ScienceComputer Science (R0)