Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arbelaitz, O., Rodriguez, C., Zamakola, I.: Low Cost Parallel Solutions for the VRPTW Optimization Problem. In: Parallel Processing Workshops, pp. 176–181 (2001)
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)
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)
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)
Huang, D.S.: A Constructive Approach for Finding Arbitrary Roots of Polynomials by Neural Networks. IEEE Transactions on Neural Networks 15, 477–491 (2004)
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)
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)
Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research 35, 254–265 (1987)
Rochat, Y., Taillard, E.D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1, 147–167 (1995)
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)
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)
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 Computing
Cook, W., Rich, J.L.: A Parallel Cutting Plane Algorithm for the VRPTW. Working Paper, Computational and Applied Mathematics, Rice University, Houston, TX (1999)
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)
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
Tan, X., Zhuo, X., Zhang, J. (2006). Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows (VRPTW). In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_4
Download citation
DOI: https://doi.org/10.1007/11816102_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37277-6
Online ISBN: 978-3-540-37282-0
eBook Packages: Computer ScienceComputer Science (R0)