An Ant Colony System for the Open Vehicle Routing Problem
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.
KeywordsLocal Search Tabu Search Tabu Search Algorithm Vehicle Route Pheromone Trail
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 11.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)Google Scholar