Ant colony system for optimizing vehicle routing problem with time windows (VRPTW)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4115 LNBI -III, Issue , 2006, Pages 33-38

  Tan, Xuan ^a,b   Zhuo, Xiaolan ^a   Zhang, Jun ^a,b  

^a SUN YAT SEN UNIVERSITY   (China)

^b Guangdong Key Lab of Information Security   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; HEURISTIC METHODS; OPTIMIZATION;

ANT COLONY SYSTEM (ACS); BENCHMARK PROBLEMS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW);

PROBLEM SOLVING;

EID: 33749578405     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11816102_4     Document Type: Conference Paper

References (14)

1. Arbelaitz, O., Rodriguez, C., Zamakola, I.: Low Cost Parallel Solutions for the VRPTW Optimization Problem. Parallel Processing Workshops (2001) 176-181
2. Boudali, I., Fki, W., Ghedira, K.: How to Deal with the VRPTW by Using Multi-Agent Coalitions. Hybrid Intelligent Systems. Proceedings (2004) 416-421
3. Lim, A., Wang, F.: A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW. Tools with Artificial Intelligence. ICTAI 2004.(2004) 704-708
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 (1999) 63-76
5. Huang, D.S.: A Constructive Approach for Finding Arbitrary Roots of Polynomials by Neural Networks. IEEE Transactions on Neural Networks. 15( 2004) 477-491
6. Huang, D.S., Horace, H.K., Chi, .Z.: Zeroing Polynomials Using Modified Constrained Neural Network Approach. IEEE Trans On Neural Networks, 16(2005) 721-732
7. Dorigo, M, Gambardella, L. M: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans on evolutionary computation. 1(1997) 53-66
8. Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research. 35 (1987) 254-265
9. Rochat, Y., Taillard, E.D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics. 1 (1995) 147-167
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. (1999) 101-116
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)
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 Computing.
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)
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)