Advertisement

An Ant Colony System for the Open Vehicle Routing Problem

  • Xiangyong Li
  • Peng Tian
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4150)

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.

Keywords

Local Search Tabu Search Tabu Search Algorithm Vehicle Route Pheromone Trail 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Schrage, L.: Formulation and structure of more complex realistic routing and scheduling problem. Networks 11, 229–232 (1981)CrossRefGoogle Scholar
  3. 3.
    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)MATHCrossRefGoogle Scholar
  4. 4.
    Brãndao, J.: A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research 157(3), 552–564 (2004)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    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)MATHCrossRefGoogle Scholar
  6. 6.
    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)MATHCrossRefGoogle Scholar
  7. 7.
    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)MATHCrossRefGoogle Scholar
  8. 8.
    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)MATHGoogle Scholar
  9. 9.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press, Massachusetts (2004)MATHCrossRefGoogle Scholar
  10. 10.
    Potvin, P., Rousseau, J.: An exchange heuristic for routing problem with time windows. Journal of the Operational Research Society 46, 1433–1446 (1995)MATHCrossRefGoogle Scholar
  11. 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
  12. 12.
    Tarantilis, C., Ioannou, G., Kiranoudis, C., Prastacos, G.: A threshold accepting approach for the open vehicle routing. RAIRO Opeartions Research 38, 345–360 (2004)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xiangyong Li
    • 1
  • Peng Tian
    • 1
  1. 1.Antai College of Economics & ManagementShanghai Jiaotong UniversityShanghaiP.R. China

Personalised recommendations