Local search with annealing-like restarts to solve the VRPTW

European Journal of Operational Research

Volumn 150, Issue 1, 2003, Pages 115-127

  Li, Haibing ^a   Lim, Andrew ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Diversification; Intensification; Local search; Routing; Vehicle routing problem with time windows

Indexed keywords

COMPUTATIONAL METHODS; EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING; SIMULATED ANNEALING;

LOCAL SEARCHES;

HEURISTIC METHODS;

EID: 0037904410     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00486-1     Document Type: Conference Paper

References (28)

1. Backer B., Furnon V., Shaw P., Kilby P., Prosser P. Solving vehicle routing problem using constraint programming and metaheuristics. Journal of Heuristics. 6:2000;501-523.
2. Chiang W., Russell R. Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research. 63:1996;3-27.
3. Chiang W., Russell R. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on Computing. 9:1997;417-430.
4. J. Cordeau, G. Desaulniers, J. Desrosiers, M. Solomon, F. Soumis, The VRP with time windows, in: Paolo Toth, Daniele Vigo (Eds.), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, 2002 pp. 157-193 (Chapter 7).
5. J. Cordeau, G. Laporte, A. Mercier, A unified tabu search heuristic for vehicle routing problems with time windows, Technical report CRT-00-03, Center for Research on Transportation, Montreal, Canada, 2000.
6. Desrochers J., Lenstra J., Savelsbergh M., Soumis F. Vehicle routing with time windows: Optimization and approximation. Vehicle Routing: Methods and Studies. 1988;Elsevier Science Publishers, North-Holland.
7. Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research. 40:1992;342-354.
8. Desrosiers J., Dumas Y., Solomon M., Sormis F. Time constrained routing and scheduling. Handbooks in Operations Research and Management Science: Network Routing. 1995;Elsevier Science Publishers, Amsterdam.
9. Dumas Y., Desrosiers J., Gelinas E., Solomon M. An optimal algorithm for the traveling salesman problem with time windows. Operations Research. 43:1995;367-371.
10. Fisher M., Jörnsten K., Madsen O. Vehicle routing with time windows: Two optimization algorithms. Operations Research. 45:1997;488-492.
11. Homberger J., Gehring H. Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR. 37:1999;297-318.
12. Kohl N., Madsen O. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation. Operations Research. 45:1997;395-406.
13. Kolen A., Rinnooy A., Trienekens H. Vehicle routing with time windows. Operations Research. 35:1987;266-273.
14. H. Li, A. Lim, A metaheuristic for the pickup and delivery problem with time windows, in: ICTAI 2001, November 2001, pp. 151-158.
15. Potvin J., Bengio S. The vehicle routing problem with time windows-part 2: Genetic search. INFORMS Journal on Computing. 8:1996;165-172.
16. Potvin J., Garcia B., Rousseau L. The vehicle routing problem with time windows - Part 1: Tabu search. INFORMS Journal on Computing. 8:1996;158-164.
17. Potvin J., Rousseau J. A parallel route building algorithms for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research. 66:1993;331-340.
18. Potvin J., Rousseau J. An exchange heuristic for routing problems with time windows. Journal of Operational Research Society. 46:1995;1433-1446.
19. Rochat Y., Semet F. A tabu search approach for delivering pet food and flour in switzerland. Journal of Operational Research Society. 45:1994;1233-1246.
20. Rochat Y., Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1:1995;147-167.
21. L. Rousseau, M. Gendreau, G. Pesant, Using constraint-based operators to solve the vehicle routing problem with time windows, Journal of Heuristics 8 (2002) 43-58.
22. Russell R. Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science. 29:1995;156-166.
23. Savelsbergh M. Local search for routing problems with time windows. Annals of Operations Research. 4:1985;285-305.
24. Savelsbergh M. The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing. 4:1992;146-154.
25. Solomon M. Algorithms for the vehicle routing and scheduling problems with time window constrains. Operations Research. 35:1987;254-264.
26. Taillard E., Badeau P., Gendreau M., Geurtin F., Potvin J. A tabu search heuristic for the vehicle routing problem with time windows. Transportation Science. 31:1997;170-186.
27. S. Thangiah, Vehicle routing with time windows using genetic algorithms, Technical report SRU-CPSC-TR-93-23, Computer Science Department, Slippery Rock University, Slippery Rock, PA, 1993.
28. S. Thangiah, I. Osman, T. Sun, Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows, Technical report UKC/OR94/4, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK, 1994.