Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows (VRPTW)

  • Xuan Tan
  • Xiaolan Zhuo
  • Jun Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4115)


Research on the optimization of Vehicle Routing Problem with Time Windows (VRPTW) is a significant investigation area of ant colony system (ACS). This paper proposes an enhanced ACS, which embeds the sequential insertion heuristic method, to solve VRPTW. The main idea is to organize two respective ant colonies to successively achieve a multiple objective minimization. Experiments on a series of benchmark problems demonstrate the excellent performance of ACS when compared with other optimization methods.


Travel Salesman Problem Benchmark Problem Greedy Randomize Adaptive Search Procedure Vehicle Route Problem Vehicle Route 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arbelaitz, O., Rodriguez, C., Zamakola, I.: Low Cost Parallel Solutions for the VRPTW Optimization Problem. In: Parallel Processing Workshops, pp. 176–181 (2001)Google Scholar
  2. 2.
    Boudali, I., Fki, W., Ghedira, K.: How to Deal with the VRPTW by Using Multi-Agent Coalitions. In: Hybrid Intelligent Systems. Proceedings, pp. 416–421 (2004)Google Scholar
  3. 3.
    Lim, A., Wang, F.: A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW. In: Tools with Artificial Intelligence. ICTAI 2004, pp. 704–708 (2004)Google Scholar
  4. 4.
    Gambardella., L.M., Taillard., E., Agazzi., G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. New Ideas in Optimization, 63–76 (1999)Google Scholar
  5. 5.
    Huang, D.S.: A Constructive Approach for Finding Arbitrary Roots of Polynomials by Neural Networks. IEEE Transactions on Neural Networks 15, 477–491 (2004)CrossRefGoogle Scholar
  6. 6.
    Huang, D.S., Horace, H.K., Chi, Z.: Zeroing Polynomials Using Modified Constrained Neural Network Approach. IEEE Trans On Neural Networks 16, 721–732 (2005)CrossRefGoogle Scholar
  7. 7.
    Dorigo, M., Gambardella, L. M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans. on evolutionary computation 1, 53–66 (1997)CrossRefGoogle Scholar
  8. 8.
    Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research 35, 254–265 (1987)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Rochat, Y., Taillard, E.D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1, 147–167 (1995)MATHCrossRefGoogle Scholar
  10. 10.
    Kohl, N., Desrosiers, J., Madsen, O.B.G., Solomon, M.M., Soumis, F.: 2-Path Cuts for the Vehicle Routing Problem with Time Windows. Transportation Science, 101–116 (1999)Google Scholar
  11. 11.
    Li, H., Lim, A., Huang, J.: Local Search with Annealing-like Restarts to Solve the VRPTW. Working Paper, Department of Computer Science, National University of Singapore (2001)Google Scholar
  12. 12.
    Irnich, S., Villeneuve, D.: The Shortest Path Problem with K-cycle Elimination (k ≥ 3): Improving a Branch-and-Price Algorithm for the VRPTW. INFORMS Journal of ComputingGoogle Scholar
  13. 13.
    Cook, W., Rich, J.L.: A Parallel Cutting Plane Algorithm for the VRPTW. Working Paper, Computational and Applied Mathematics, Rice University, Houston, TX (1999)Google Scholar
  14. 14.
    Kallehauge, B., Larsen, J., Madsen, O.B.G.: Lagrangean Duality and Non-Differentiable Optimization Applied on Routing with Time Windows - Experimental Results. Internal report IMM-REP-2000-8, Technical University of Denmark, Lyngby, Denmark (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xuan Tan
    • 1
    • 2
  • Xiaolan Zhuo
    • 1
  • Jun Zhang
    • 1
    • 2
  1. 1.Department of Computer ScienceSUN Yat-sen UniversityP.R. China
  2. 2.Guangdong Key Lab of Information Security 

Personalised recommendations