A reactive variable neighborhood search for the vehicle-routing problem with time windows

INFORMS Journal on Computing

Volumn 15, Issue 4, 2003, Pages 347-368

  Bräysy, Olli ^a  

^a SINTEF   (Norway)

Author keywords

Metaheuristics; Time Windows; Vehicle Routing

Indexed keywords

COMPUTATIONAL COMPLEXITY; CUSTOMER SATISFACTION; ELECTRIC LOAD MANAGEMENT; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING;

OPERATIONAL PLANNING; TIME WINDOWS; VEHICLE ROUTING; VEHICLE-ROUTING PROBLEMS;

HEURISTIC METHODS;

EID: 3843138356     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.15.4.347.24896     Document Type: Article

References (73)

1. Antes, J., U. Derigs. 1995. A new parallel tour construction algorithm for the vehicle routing problem with time windows. Working Paper, Department of Economics and Computer Science, University of Köln, Germany.
2. Bachem, A., W. Hochstättler, M. Malich. 1996. The simulated trading heuristic for solving vehicle routing problems. Discrete Appl. Math. 65 47-72.
3. 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.
4. Baker, E. K., J. R. Schaffer. 1986. Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints. Amer. J. Math. Management Sci. 6 261-300.
5. Barnes, J. W., W. B. Carlton. 1995. A tabu search approach to the vehicle routing problem with time windows. Fall INFORMS Conference, New Orleans, LA.
6. Battiti, R., G. Tecchiolli. 1994. The reactive tabu search. ORSA J. Comput. 6 126-140.
7. Berger, J., M. Salois, R. Begin. 1998. A hybrid genetic algorithm for the vehicle routing problem with time windows. Lecture Notes in Artificial Intelligence, No. 1418, AI'98, Advances in Artificial Intelligence, Vancouver, BC, Canada, 114-127.
8. Blanton, J. L., R. L. Wainwright. 1993. Multiple vehicle routing with time and capacity constraints using genetic algorithms. S. Forrest, ed. Proc. Fifth Internat. Conf. on Genetic Algorithms. Morgan Kaufmann Publishing, San Francisco, CA, 452-459.
9. Bramel, J., D. Simchi-Levi. 1996. Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Oper. Res. 44 501-509.
10. Brandão, J. 1999. Metaheuristic for the vehicle routing problem with time windows. S. Voss, S. Martello, I. H. Osman, C. Roucairol, eds. Meta-heuristics - Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Boston, MA, 19-36.
11. Bräysy, O. 1999a. A hybrid genetic algorithm for the vehicle routing problem with time windows. Licentiate thesis, Department of Mathematics and Statistics, University of Vaasa, Vaasa, Finland.
12. Bräysy, O. 1999b. A new algorithm for the vehicle routing problem with time windows based on the hybridization of a genetic algorithm and route construction heuristics. Proc. University of Vaasa, Research papers 227. University of Vaasa, Vaasa, Finland.
13. Bräysy, O. 2001. Local search and variable neighborhood search algorithms for the vehicle routing problem with time windows. Doctoral thesis, Department of Mathematics and Statistics, University of Vaasa, Vaasa, Finland.
14. Bräysy, O., J. Berger, M. Barkaoui. 2000. A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. Route 2000-Workshop, Skodsborg, Denmark.
15. Carlton, W. B. 1995. A tabu search approach to the general vehicle routing problem. Ph.D. thesis, Department of Mechanical Engineering, University of Texas, Austin, TX.
16. Caseau, Y., F. Laburthe. 1999. Heuristics for large constrained vehicle routing problems. J. Heuristics 5 281-303.
17. Chiang, W. C., R. A. Russell. 1996. Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 63 3-27.
18. 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.
19. Clarke, G., J. W. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 568-581.
20. Cook, W., J. L. Rich. 1999. A parallel cutting-plane algorithm for the vehicle routing problems with time windows. Working Paper, Department of Computational and Applied Mathematics, Rice University, Houston, TX.
21. Cordeau, J-F., G. Desaulniers, J. Desrosiers, M. M. Solomon, F. Soumis. 2001a. The VRP with time windows. P. Toth and D. Vigo, eds. The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA, 157-194.
22. Cordeau, J-F., G. Laporte, A. Mercier. 2001b. A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52 928-936.
23. Cordone, R., R. Wolfler-Calvo. 2001. A heuristic for the vehicle routing problem with time windows. J. Heuristics 7 107-129.
24. 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.
25. Desrochers, M., J. K. Lenstra, M. W. P. Savelsbergh, F. Soumis. 1988. Vehicle routing with time windows: optimization and approximation. B. Golden and A. Assad, eds. Vehicle Routing: Methods and Studies. Elsevier Science Publishers, Amsterdam, The Netherlands, 65-84.
26. Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. Ball, ed. Handbooks in Operations Research and Management Science 8: Network Routing. Elsevier Science Publishers, Amsterdam, The Netherlands, 35-139.
27. Dongarra, J. 1998. Performance of various computers using standard linear equations software. Report CS-89-85, Department of Computer Science, University of Tennessee, Knoxville, TN.
28. 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.
29. 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.
30. 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 - Short Course on Evolutionary Algorithms in Engineering and Comput. Sci., Reports of the Department of Mathematical Information Technology, Series A. Collections, No. A 2/1999. University of Jyväskylä, Jyväskylä, Finland, 57-64.
31. 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.
32. 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.
33. 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.
34. Golden, B. L., A. A. Assad. 1986. Perspectives on vehicle routing: exciting new developments. Oper. Res. 34 803-809.
35. Golden, B. L., A. A. Assad. 1988. Vehicle Routing: Methods and Studies. Elsevier Science Publishers, Amsterdam, The Netherlands.
36. Hansen, P., N. Mladenovic. 2002. Variable neighborhood search. P. M. Pardalos, M. G. C. Resende, eds. Handbook of Applied Optimization. Oxford University Press, New York, 221-234.
37. Homberger, J., H. Gehring. 1999. Two evolutionary meta-heuristics for the vehicle routing problem with time windows. INFOR 37 297-318.
38. 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 Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Boston, MA, 473-486.
39. Kohl, N. 1995. Exact methods for time constrained routing and related scheduling problems. Ph.D. thesis, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark.
40. Kohl, N., J. Desrosiers, O. B. G. Madsen, M. M. Solomon, F. Soumis. 1999. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33 101-116.
41. Kontoravdis, G. A., J. F. Bard. 1995. A GRASP for the vehicle routing problem with time windows ORSA. J. Comput. 7 10-23.
42. Larsen, J. 1999. Parallelization of the vehicle routing problem with time windows. Ph.D. thesis, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark.
43. 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.
44. Mladenovic, N., P. Hansen. 1997. Variable neighborhood search. Comput. Oper. Res. 24 1097-1100.
45. Or, I. 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Department of Computer Science, Northwestern University, Evanston, IL.
46. Osman, I. H. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Ann. Oper. Res. 41 421-452.
47. Potvin, J-Y., S. Bengio. 1996. The vehicle routing problem with time windows part II: genetic search. ORSA J. Comput. 8 165-172.
48. Potvin, J-Y., T. Kervahut, B. L. Garcia, J-M. Rousseau, 1996b. The vehicle routing problem with time windows part I: Tabu search. ORSA J. Comput. 8 157-164.
49. Potvin, J-Y., D. Dube, C. Robillard. 1996a. A hybrid approach to vehicle routing using neural networks and genetic algorithms. Appl. Intelligence 6 241-252.
50. Potvin, J-Y., C. Robillard. 1995. Clustering for vehicle routing with a competitive neural network. Neurocomputing 8 125-139.
51. 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.
52. Potvin, J-Y., J-M. Rousseau. 1995. An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc. 46 1433-1446.
53. Rochat, Y., E. Taillard. 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1 147-167.
54. 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.
55. Russell, R. 1977. An effective heuristic for the M-tour traveling salesman problem with some side conditions. Oper. Res. 25 517-524.
56. Russell, R. A. 1995. Hybrid heuristics for the vehicle routing problem with time windows. Transportation Sci. 29 156-166.
57. Savelsbergh, M. W. P. 1992. The vehicle routing problem with time windows: minimizing route duration. ORSA J. Comput. 4 146-154.
58. Schulze, J., T. Fahle. 1999. A parallel algorithm for the vehicle routing problem with time window constraints. Ann. Oper. Res. 86 585-607.
59. Shaw, P. 1997. A new local search algorithm providing high quality solutions to vehicle routing problems. Working Paper, Department of Computer Science, University of Strathclyde, Glasgow, Scotland.
60. 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.
61. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35 254-265.
62. Solomon, M. M., E. K. Baker, J. R. Schaffer. 1988. Vehicle routing and scheduling problems with time window constraints: efficient implementations of solution improvement procedures. B. Golden, A. Assad, eds. Vehicle Routing: Methods and Studies. Elsevier Science Publishers, Amsterdam, The Netherlands, 85-106.
63. Solomon, M. M., J. Desrosiers. 1988. Time window constrained routing and scheduling problems. Transportation Sci. 22 1-13.
64. 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.
65. Tan, K. C., L. H. Lee, K. Ou. 2001. Hybrid genetic algorithms in solving vehicle routing problems with time window constraints. Asia-Pacific J. Oper. Res. 18 121-130.
66. Tan, K. C., L. H. Lee, K. Q. Zhu. 2000. Heuristic methods for vehicle routing problem with time windows. Proc. 6th Internat. Sympos. on Artificial Intelligence & Mathematics, Ft. Lauderdale, FL.
67. Thangiah, S. 1995. Vehicle routing with time windows using genetic algorithms. L. Chambers, ed. Application Handbook of Genetic Algorithms: New Frontiers, Volume II. CRC Press, Boca Raton, FL, 253-277.
68. Thangiah, S., 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.
69. 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.
70. Thompson, P. M., H. N. Psaraftis. 1993. Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper. Res. 41 935-946.
71. Van Landeghem, H. R. G. 1988. A bi-criteria heuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 36 217-226.
72. Voudouris, C. 1997. Guided local search for combinatorial problems. Ph.D. thesis, Department of Computer Science, University of Essex, Colchester, UK.
73. Voudouris, C., E. Tsang. 1998. Guided local search. Eur. J. Oper. Res. 113 80-119.