Vehicle routing problem with time windows, Part II: Metaheuristics

Transportation Science

Volumn 39, Issue 1, 2005, Pages 119-139

  Bräysy, Olli ^a   Gendreau, Michel ^b  

^a UNIVERSITY OF JYVÄSKYLÄ   (Finland)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Genetic algorithms; Heuristics; Metaheuristics; Tabu search; Time windows; Vehicle routing

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC METHODS; VEHICLES;

HEURISTICS; METAHEURISTICS; TABU SEARCH; TIME WINDOWS; VEHICLE ROUTING;

TRANSPORTATION ROUTES;

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

References (102)

1. Aarts, J., H. M. Korst, P. J. M. Van Laarhaven. 1997. Simulated annealing. E. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, UK, 91-120.
2. Alander, J. T. 2000. An indexed bibliography of genetic algorithms in operations research. Technical Report 94-1-OR, University of Vaasa, Finland. Available via anonymous ftp site ftp.uwasa.fi directory cs/ report94-1 file gaORbib.ps.Z.
3. Anderson, D., E. Anderson, N. Lesh, J. Marks, B. Mirtich, D. Ratajczak, K. Ryall. 2000. Human-guided simple search. Working paper, Mitsubishi Electric Research Laboratory, Cambridge, MA.
4. Bachem, A., W. Hochstättler, M. Malich. 1996. The simulated trading heuristic for solving vehicle routing problems. Discrete Appl. Math 65 47-72.
5. Badeau, P., M. Gendreau, F. Guertin, J.-Y. Potvin, E. Taillard. 1997. A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Res. C 5 109-122.
6. Beasley, J. E. 1990. A Lagrangian heuristic for set covering problems. Naval Res. Logist. 37 151-164.
7. Bent, R., P. Van Hentenryck. 2004. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Sci. 38(4) 515-530.
8. Benyahia, I., J.-Y. Potvin. 1995. Generalization and refinement of route construction heuristics using genetic algorithms. Proc. 1995 IEEE Internat. Conf. Evolutionary Comput., IEEE Service Center, Piscataway, NJ, 39-43.
9. Berger, J., M. Barkaoui, O. Bräysy. 2003. A route-directed hybrid genetic approach for the vehicle routing problem with time windows. Inform. Systems Oper. Res. 41 179-194.
10. Berger, J., M. Salois, R. Begin. 1998. A hybrid genetic algorithm for the vehicle routing problem with time windows. Lecture Notes Artificial Intelligence 1418 114-127.
11. Blanton, J. L., R. L. Wainwright. 1993. Multiple vehicle routing with time and capacity constraints using genetic algorithms. S. Forrest, ed. Proc. 5th Internat. Conf. Genetic Algorithms, Morgan Kaufmann Publishing, San Francisco, CA, 452-459.
12. Brandao, J. 1999. Metaheuristic for the vehicle routing problem with time windows. S. Voss, S. Martello, I. H. Osman, C. Roucairol, eds. Metaheuristics - Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Boston, MA, 19-36.
13. Bräsy, O. 2002. Fast local searches for the vehicle routing problem with time windows. Inform. Systems Oper. Res. 40 319-330.
14. Bräysy, O. 2003. A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J. Comput. 15 347-368.
15. Bräysy, O., M. Gendreau. 2005. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Sci. 39(1) 104-118.
16. Bräysy, O., W. Dullaert, M. Gendreau. 2004a. Evolutionary algorithms for the vehicle routing problem with time windows. J. Heuristics 10 587-611.
17. Bräysy, O., G. Hasle, W. Dullaert. 2004b. A multi-start local search algorithm for the vehicle routing problem with time windows. Eur. J. Oper. Res. 159 586-605.
18. Carlton, W. B. 1995. A tabu search approach to the general vehicle routing problem. Ph.D. thesis, University of Texas, Austin, TX.
19. Caseau, Y., F. Laburthe. 1999a. Heuristics for large constrained vehicle routing problems. J. Heuristics 5 281-303.
20. Caseau, Y., F. Laburthe, G. Silverstein. 1999b. A meta-heuristic factory for vehicle routing problems. J. Jaffar, ed. Principles and Practice of Constraint Programming - CP'99, Lecture Notes in Computer Science. Springer-Verlag, New York, 144-158.
21. Chiang, W. C., R. A. Russell. 1996. Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 63 3-27.
22. Chiang, W. C., R. A. Russell. 1997. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J. Comput. 9 417-430.
23. Christofides, N., J. Beasley. 1984. The period routing problem. Networks 14 237-246.
24. Clarke, G., J. W. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 568-581.
25. Cordeau, J.-F., G. Laporte, A. Mercier. 2001. A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52 928-936.
26. Cordeau, J.-F., M. Gendreau, G. Laporte, J.-Y. Potvin, F. Semet. 2002. A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53 512-522.
27. Czech, Z., P. Czarnas. 2002. 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.
28. De Backer, B., V. Furnon. 1997. Meta-heuristics in constraint programming experiments with tabu search on the vehicle routing problem. Proc. Second Internat. Conf. Metaheuristics (MIC'97), Sophia Antipolis, France, 1-14.
29. De Backer, B., V. Furnon, P. Kilby, P. Prosser, P. Shaw. 2000. Solving vehicle routing problems using constraint programming and metaheuristics. J. Heuristics 6 501-523.
30. De Jong, K. A. 1975. An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan.
31. Dongarra, J. 1998. Performance of various computers using standard linear equations software. Report CS-89-85, Department of Computer Science, University of Tennessee, TN.
32. Dorigo, M., G. Di Caro, L. M. Gambardella. 1999. Ant algorithms for discrete optimization. Artificial Life 5 137-172.
33. Faigle, U., W. Kern. 1992. Some convergence results for probabilistic tabu search. ORSA J. Comput. 4 32-37.
34. Fogel, D. B. 1995. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, New York.
35. Fox, B. L. 1993. Integrating and accelerating tabu search, simulated annealing and genetic algorithms. Ann. Oper. Res. 41 47-67.
36. Gambardella, L. M., 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, UK, 63-76.
37. Garcia, B.-L., J.-Y. Potvin, J.-M. Rousseau. 1994. A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Comput. Oper. Res. 21 1025-1033.
38. Gehring, H., J. Homberger. 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. K. Miettinen, M. Mäkelä, J. Toivanen, eds. Proc. EUROGEN99, University of Jyväskylä, Finland, 57-64.
39. Gehring, H., J. Homberger 2001. Parallelization of a two-phase metaheuristic for routing problems with time windows. Asia-Pacific J. Oper. Res. 18 35-47.
40. Gendreau, M. 2003. An introduction to tabu search. F. Glover, G. A. Kochenberger, eds. Handbook of Metaheuristics. Kluwer Academic Publishers, Boston, MA.
41. Gendreau, M., A. Hertz, G. Laporte. 1992. A new insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40 1086-1093.
42. Gendreau, M., A. Hertz, G. Laporte. 1994. A tabu search heuristic for the vehicle routing problem. Management Sci. 40 1276-1290.
43. Gendreau, M., A. Hertz, G. Laporte, M. Stan. 1998. A generalized insertion heuristic for the traveling salesman problem with time windows. Oper. Res. 46 330-335.
44. Gillett, B., L. R. Miller. 1974. A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 22 340-349.
45. Glover, F. 1986. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13 533-549.
46. Glover, F. 1989. Tabu search - Part I. ORSA J. Comput. 1 190-206.
47. Glover, F. 1990. Tabu search - Part II. ORSA J. Comput. 2 4-32.
48. Glover, F. 1991. Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem. Working paper, College of Business & Administration, University of Colorado, Boulder, CO.
49. Glover, F. 1992. New ejection chain and alternating path methods for traveling salesman problems. O. Balci, R. Sharda, S. Zenios, eds. Computer Science and Operations Research: New Developments in Their Interfaces. Pergamon Press, Oxford, UK, 449-509.
50. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Boston, MA.
51. Goldberg, D. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley Publishing Company Inc., New York.
52. Golden, B. L., W. R. Stewart. 1985. Empirical analysis of heuristics. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. The Traveling Salesman Problem. John Wiley and Sons, Chichester, UK, 207-249.
53. Hertz, A., E. Taillard, D. de Werra. 1997. Tabu search. E. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, UK, 121-136.
54. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI.
55. Homberger, J., H. Gehring. 1999. Two evolutionary metaheuristics for the vehicle routing problem with time windows. Inform. Systems Oper. Res. 37 297-318.
56. Homberger, J., H. Gehring. 2005. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 162 220-238.
57. Hopfield, J. J., D. W. Tank 1985. Neural computation of decisions in optimization problems. Biological Cybernetics 52 141-152.
58. Ibaraki, T., S. Imahori, M. Kubo, T. Masuda, T. Uno, M. Yagiura. 2002. Effective local search algorithms for routing and scheduling problems with general time window constraints. Transportation Science. Forthcoming.
59. Jung, S., B.-R. Moon. 2002. A hybrid genetic algorithm for the vehicle routing problem with time windows. Proc. Genetic Evolutionary Comput. Conf., Morgan Kaufmann, San Francisco, 1309-1316.
60. Kilby, P., P. Prosser, P. Shaw. 1999. Guided local search for the vehicle routing problem with time windows. S. Voss, S. Martello, I. H. Osman, C. Roucairol, eds. META-HEURISTICS Advanced Trends Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, MA, 473-486.
61. Kirkpatrick, S., C. D. Gelatt, P. M. Vecchi. 1983. Optimization by simulated annealing. Science 220 671-680.
62. Kohonen, T. 1988. Self-Organization and Associative Memory. Springer-Verlag, Berlin, Germany.
63. Kontoravdis, G. A., J. F. Bard. 1995. A GRASP for the vehicle routing problem with time windows. INFORMS J. Comput. 7 10-23.
64. Lau, H. C., Y. F. Lim, Q. Liu. 2001. Diversification of neighborhood via constraint-based local search and its application to VRPTW. Proc. CP-AI-OR 2001 Workshop, Kent, UK.
65. Lau, H. C., M. Sim, K. M. Teo. 2003. Vehicle routing problem with time windows and a limited number of vehicles. Eur. J. Oper. Res. 148 559-568.
66. Le Bouthillier, A., T. G. Crainic. 2005. A cooperative parallel metaheuristic for vehicle routing with time windows. Comput. Oper. Res. 32 1685-1708.
67. Li, H., A. Lim 2001. Large scale time-constrained vehicle routing problems: A general metaheuristic framework with extensive experimental results. Working paper, National University of Singapore.
68. Li, H., A. Lim, J. Huang. 2003. Local search with annealing-like restarts to solve the VRPTW. Eur. J. Oper. Res. 150 115-127.
69. Liu, F.-H., S.-Y. Shen. 1999. A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. Eur. J. Oper. Res. 118 485-504.
70. Mester, D. 2002. An evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time window restrictions. Working paper, Institute of Evolution, University of Haifa, Israel.
71. Metropolis, W., A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller. 1953. Equation of the state calculations by fast computing machines. J. Chemical Physics 21 1087-1092.
72. Mladenovic, N., P. Hansen. 1997. Variable neighborhood search. Comput. Oper. Res. 24 1097-1100.
73. Mühlenbein, H. 1997. Genetic algorithms. E. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, UK, 137-172.
74. Or, I. 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Northwestern University, IL.
75. Pesant, G., M. Gendreau, J. M. Rousseau. 1997. GENIUS-CP: A generic vehicle routing algorithm. G. Smolka, ed. Principles and Practice of Constraint Programming - CP97, Lecture Notes in Computer Science. Springer-Verlag, New York, 420-434.
76. Pesant, G., M. Gendreau, J.-Y. Potvin, J.-M. Rousseau. 1998. An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Sci. 32 12-29.
77. Potvin, J.-Y., S. Bengio. 1996. The vehicle routing problem with time windows, Part II: Genetic search. INFORMS J. Comput. 8 165-172.
78. Potvin, J.-Y., C. Robillard. 1995. Clustering for vehicle routing with a competitive neural network. Neurocomputing 8 125-139.
79. Potvin, J.-Y., J.-M. Rousseau. 1993. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66 331-340.
80. Potvin, J.-Y., D. Dubé, C. Robillard. 1996. A hybrid approach to vehicle routing using neural networks and genetic algorithms. Appl. Intelligence 6 241-252.
81. Potvin, J.-Y., T. Kervahut, B. L. Garcia, J.-M. Rousseau. 1996. The vehicle routing problem with time windows, Part I: Tabu search. INFORMS J. Comput. 8 157-164.
82. Rechenberg, I. 1973. Evolutionsstrategie. Fromman-Holzboog, Stuttgart.
83. Rochat, Y., E. Taillard. 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1 147-167.
84. Rousseau, L.-M., M. Gendreau, G. Pesant. 2002. Using constraint-based operators to solve the vehicle routing problem with time windows. J. Heuristics 8 43-58.
85. Russell, R. A. 1995. Hybrid heuristics for the vehicle routing problem with time windows. Transportation Sci. 29 156-166.
86. Schulze, J., T. Fahle. 1999. A parallel algorithm for the vehicle routing problem with time window constraints. Ann. Oper. Res. 86 585-607.
87. Schwefel, H.-P. 1977. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhäuser, Basel.
88. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. M. Maher, J.-F. Puget, eds. Principles and Practice of Constraint Programming -CP98, Lecture Notes in Computer Science. Springer-Verlag, New York, 417-431.
89. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35 254-265.
90. Taillard, E., P. Badeau, M. Gendreau, F. Guertin, J.-Y. Potvin. 1997. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. 31 170-186.
91. Tan, K. C., L. H. Lee, K. Q. Zhu. 2000. Heuristic methods for vehicle routing problem with time windows. Proc. 6th Internat. Sympos. Artificial Intelligence Math., Ft. Lauderdale, FL.
92. Tan, K. C., L. H. Lee, K. Ou 2001a. Hybrid genetic algorithms in solving vehicle routing problems with time window constraints. Asia-Pacific J. Oper. Res. 18 121-130.
93. Tan, K. C., T. H. Lee, K. Ou, L. H. Lee. 2001b. A messy genetic algorithm for the vehicle routing problem with time window constraints. Proc. 2001 Congress Evolutionary Comput., IEEE Service Center, Pistacaway, NJ, 679-686.
94. Tan, K. C., L. H. Lee, K. Ou. 2001c. Artificial intelligence heuristics in solving vehicle routing problems with time window constraints. Engrg. Appl. Artificial Intelligence 14 825-837.
95. Thangiah, S. R. 1995a. Vehicle routing with time windows using genetic algorithms. L. Chambers, ed. Application Handbook of Genetic Algorithms: New Frontiers, Vol. II. CRC Press, Boca Raton, FL, 253-277.
96. Thangiah, S. R. 1995b. An adaptive clustering method using a geometric shape for vehicle routing problems with time windows. L. J. Eshelman, ed. Proc. 6th Internat. Conf. Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 536-543.
97. Thangiah, S. R., K. E. Nygard, P. L. Juell. 1991. GIDEON: A genetic algorithm system for vehicle routing with time windows. Proc. 7th IEEE Conf. Artificial Intelligence Appl., IEEE Computer Society Press, Los Alamitos, 322-328.
98. Thangiah, S. R., I. Osman, T. Sun. 1994. Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows. Working paper UKC/IMS/OR94/4, Institute of Mathematics and Statistics, University of Kent, Canterbury. UK.
99. Thangiah, S. R., I. H. Osman, R. Vinayagamoorthy, T. Sun. 1995. Algorithms for the vehicle routing problems with time deadlines. Amer. J. Math. Management Sci. 13 323-355.
100. Voudouris, C. 1997. Guided local search for combinatorial problems. Ph.D. thesis, Department of Computer Science, University of Essex, Colchester, UK.
101. Voudouris, C., E. Tsang. 1998. Guided local search. Eur. J. Oper. Res. 113 80-119.
102. Wee Kit, H., J. Chin, A. Lim. 2001. A hybrid search algorithm for the vehicle routing problem with time windows. Internat. J. Artificial Intelligence Tools 10 431-449.