A two-stage hybrid local search for the vehicle routing problem with time windows

Transportation Science

Volumn 38, Issue 4, 2004, Pages 515-530

  Bent, Russell ^a   Van Hentenryck, Pascal ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Large neighborhood search; Simulated annealing; Vehicle routing

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; MOTOR TRANSPORTATION; OPTIMIZATION; SIMULATED ANNEALING; TRANSPORTATION ROUTES;

LARGE NEIGHBORHOOD SEARCH; TIME WINDOWS; VEHICLE ROUTING;

OPERATIONS RESEARCH;

EID: 10644284878     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0049     Document Type: Article

References (40)

1. Berger, J., M. Barkaoui, O. Bräysy. 2001. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Working paper, Defense Research Establishment Valcartier, Val Belair, Canada.
2. Bräysy, O. 2001a. Five local search algorithms for the vehicle routing problem with time windows. Working paper, SINTEF Applied Mathematics, Department of Optimization, Norway.
3. Bräysy, O. 2001b. Local search and variable neighborhood search algorithms for the VRPTW. Acta Wasaensia 87, Mathematics 8, Operational Research, Universitas Wasaensis, Vaasa, Oslo, Finland.
4. Bräysy, O. 2003. A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J. Comput. 15(4) 347-368.
5. Chiang, W., R. Russell. 1996. Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 63 3-27.
6. Chiang, W., R. Russell. 1997. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J. Comput. 9 417-430.
7. Christofides, N., J. Beasley. 1984. The period routing problem. Networks 14 237-246.
8. Cordeau, J., G. Laporte, A. Mercier. 2001. A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52 928-936.
9. Czech, Z., P. Czarnas. 2002. A parallel simulated annealing for the vehicle routing problem with time windows. Proc. 10th Euromicro Workshop Parallel, Distributed Network-based Processing, Canary Islands, Spain, 376-383.
10. Davis, L. 1991. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York.
11. De Backer, B., V. Furnon, P. Shaw, P. Kilby, P. Prosser. 2000. Solving vehicle routing problems using constraint programming and metaheuristics. J. Heuristics 6 501-523.
12. Desrochers, M., J. Desrosiers, M. Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 342-354.
13. Fisher, M., K. Joernsten, O. Madsen. 1997. Vehicle routing with time windows: Two optimization algorithms. Oper. Res. 45(3) 488-492.
14. Gambardella, L., E. Taillard, G. Agazzi. 1999. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. D. Corne, M. Dorigo, F. Glover, eds. New Ideas in Optimization. McGraw-Hill, London, U.K., 63-76.
15. Gehring, H., J. Homberger. 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. Proc. EUROGEN99 - Short Course on Evolutionary Algorithms Engrg. Comput. Sci., Reports of the Department of Mathematical Information Technology Series A, Collections, A2/1999, University of Jyvaskyla, Jyväskylä, Finland, 57-64.
16. Gehring, H., J. Homberger. 2001. A parallel two-phase metaheuristic for routing problems with time windows. Asia-Pacific J. Oper. Res. 18 35-47.
17. Gendreau, M., G. Laporte, J. Potvin. 1997. Vehicle routing: Modern heuristics. E. Aarts, J. Lenstra, eds. Local Search in Combinatorial Optimization, Ch. 9. John Wiley & Sons Ltd., New York, 311-336.
18. Glover, F. 1989. Tabu search. ORSA J. Comput. 1 190-206.
19. Hansen, P., N. Mladenovic. 1998. An introduction to variable neighborhood search. S. Voss, S. Martello, I. H. Osman, C. Roucairol, eds. Meta-heuristics, Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, New York, 433-458.
20. Harvey, W., M. Ginsberg. 1995. Limited discrepancy search. Proc. 14th Internat. Joint Conf. Artificial Intelligence, Montreal, Canada.
21. Homberger, J., H. Gehring. 1999. Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37 297-318.
22. Homberger, W. 2000. Verteilt-Parallele Metaheuristiken zur Tourenplanung. Gaber, Wiesbaden, Germany.
23. Ibaraki, T., M. Kubo, T. Masuda, T. Uno, M. Yagiura. 2001. Effective local search algorithms for the vehicle routing problem with general time windows. Proc. 4th Metaheuristics Internat. Conf., Porto, Portugal.
24. Ioannou, G., M. Kritikos, G. Prastacos. 2001. A greedy look-ahead heuristic for the vehicle routing problem with time windows. J. Oper. Res. Soc. 52 523-537.
25. Johnson, D., C. Aragon, L. McGeoch, C. Schevon. 1991. Optimization by simulated annealing: An experimental evaluation; Part II, graph coloring and number partitioning. Oper. Res. 39(3) 378-406.
26. Kindervater, G., M. Savelsbergh. 1997. Vehicle routing: Handling edge exchanges. E. Aarts, J. Lenstra, eds. Local Search in Combinatorial Optimization, Ch. 10. John Wiley & Sons Ltd., New York, 337-360.
27. Kirkpatrick, S., C. Gelatt, M. Vecchi. 1983. Optimization by simulated annealing. Science 220 671-680.
28. Kohl, N., J. Desrosiers, O. Madsen, M. Solomon, F. Soumis. 1999. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33 101-116.
29. Lenstra, J., A. H. G. Rinnooy Kan. 1981. Complexity of vehicle routing and scheduling problems. Networks 11 221-227.
30. Or, I. 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph.D. thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL.
31. Osman, I. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 40 1) 421-452.
32. Potvin, J., S. Begio. 1996. The vehicle routing problem with time windows - Part II: Genetic search. INFORMS J. Comput. 8 165-172.
33. Potvin, J., J. Rousseau. 1995. An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc. 46 1433-1446.
34. Rochat, Y., E. Taillard. 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1 147-167.
35. Rousseau, L., M. Gendreau, G. Pesant. 2002. Using constraint-based operators to solve the vehicle routing problem with time windows. J. Heuristics 8 43-58.
36. Schrimpf, G., J. Schneider, H. Stamm-Wilbrandt, G. Dueck. 2000. Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159 139-171.
37. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. Proc. Principles Practice Constraint Programming, Pisa, Italy, 417-431.
38. Solomon, M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2) 254-265.
39. Taillard, E., P. Badeau, M. Gendreau, F. Geurtin, J. Potvin. 1997. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. 31 170-186.
40. Thangiah, S., I. Osman, T. Sun. 1994. Hybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows. Technical Report UKC/OR94/4, Institute of Mathematics & Statistics, University of Kent, Canterbury, U.K.