Chapter 23 Vehicle routing

Foundations of Artificial Intelligence

Volumn 2, Issue C, 2006, Pages 801-836

  Kilby, Philip ^a   Shaw, Paul ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956768480     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(06)80027-1     Document Type: Chapter

References (116)

1. Aarts E., Korst J.H.M., and Van Laarhoven P.J.M. Simulated annealing. In: Aarts E., and Lenstra J. (Eds). Local Search in Combinatorial Optimization (1997), John Wiley & Sons 91-120
2. Achuthan N.R., Caccetta L., and Hill S.P. A new subtour elimination constraint for the vehicle routing problem. European Journal of Operational Research 91 3 (1996) 573-586
3. Achuthan N.R., Caccetta L., and Hill S.P. An improved branch-and-cut algorithm for the capacitated vehicle routing problem. Transportation Science 37 2 (2003) 153-169
4. Aho A.V., Hopcroft J.E., and Ullman J.D. Data Structures and Algorithms (1983), Addison-Wesley, Chichester
5. Anbil R., Forrest J.J., and Pulleyblank W.R. Column generation and the airline crew pairing problem. Documenta Mathematica Journal Extra Volume ICM III (1998) 677-686
6. Araque J., Kudva G., Morin T., and Pekny J. A branch-and-cut algorithm for vehicle routing problems. Annals of Operations Research 50 (1994) 37
7. Beck J., Prosser P., and Selensky E. Vehicle routing and job shop scheduling: What's the difference?. In: Kaufmann M. (Ed). 13th International Conference on Automated Planning and Scheduling ICAPS'03 (2003)
8. Beck J.C., Prosser P., and Selensky E. On the reformulation of vehicle routing problems and scheduling problems. Proceedings of SARA 2002, Symposium on Abstraction, Reformulation and Approximation. Lecture Notes in Computer Science volume 2371 (2002), Springer-Verlag, Berlin 282-289
9. Benoist T., Laburthe F.C., and Rottembourg B. Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems. Proceedings CP-AI-OR'01, Ashford 2001 (2001)
10. Bent R., and Van Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38 4 (2004) 515
11. Berger J., Barkaoui M., and Bräysy O. A route-directed hybrid genetic approach for the vehicle routing problem with time windows. INFOR 41 (2003) 179-194
12. Bräysy O. A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS Journal on Computing 15 4 (2003) 347-368
13. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science 39 1 (2005) 104-118
14. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science 39 1 (2005) 119
15. Bureau of Transportation Statistics. National Transportation Statistics (NTS) 2004 (2005), Bureau of Transportation Statistics
16. Butt S., and Ryan D. An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computers and Operation Research 26 4 (1999) 427-441
17. Calvo R.W. A new heuristic for the traveling salesman problem with time windows. Transportation Science 34 1 (2000) 113-124
18. Campos V., Corberán A., and Mota E. Polyhedral results for a vehicle routing problem. European Journal of Operations Research 52 (1991) 75
19. Caseau Y., and Laburthe F. Solving small TSPs with constraints. Proceedings of the 14th International Conference on Logic Programming (1997), The MIT Press 316-330
20. Caseau Y., and Laburthe F.C. Heuristics for large constrained vehicle routing problems. Journal of Heuristics 5 3 (1999) 281-303
21. Caseau Y., Laburthe F.C., and Silverstein G. A meta-heuristic factory for vehicle routing problems. In: Jaffar J. (Ed). Proceedings, Principles and Practice of Constraint Programming - CP'99. Alexandria, VA, USA, October 11-14, 1999. Lecture Notes in Computer Science volume 1713 (2004), Springer, Heidelberg 144-159
22. Cattrysse D.G., Salomon M., and Van Wassenhove L.N. A set partitioning heuristic for the generalised assignment problem. Europenal Journal of Operational Research 72 (1994) 167-174
23. Chiang W., and Russell R. Simulated annealing metaheuristics to vehicle routing problems with time windows. Annals of Operations Research 63 (1996) 3-27
24. Chiang W.-C., and Russel R.A. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal of Computing 9 4 (1997) 417-430
25. Clarke G., and Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
26. Cordeau J.-F., Laporte G., and Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52 8 (2001) 928-936
27. Cornuéjols G., and Harche F. Polyhedral study of the capacitated vehicle routing problem. Mathematical Programming 60 (1993) 21
28. Cowling P.I., and Keuthen R. Embedded local search approaches for routing optimization. Computers & Operations Research 32 3 (2005) 465-490
29. Crainic T.G., Malucelli F., Nonato M., and Guertin F.C. Meta-heuristics for a class of demand-responsive transit systems. INFORMS Journal on Computing 17 1 (2005) 10-24
30. Danna E., and Le Pape C. Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows. In: Desaulniers G., Desrosiers J., and Solomon M.M. (Eds). Column Generation (2005), Kluwer Academic Publishers 99-130
31. De Backer B., Furnon V., Prosser P., Kilby P., and Shaw P. Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics 6 4 (2000) 501-523
32. Desaulniers G., Lavigne J., and Soumis F. Multi-depot vehicle scheduling problems with time windows and waiting costs. European Journal of Operational Research 111 (1998) 479-494
33. In: Desaulniers G., Desrosiers J., and Solomon M.M. (Eds). Column Generation (2005), Springer
34. March. Desrochers M., Desrosiers J., and Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40 2 (1992) 342-354
35. chapter 2. Desrosiers J., Dumas Y., Solomon M.M., and Soumis F.C. Time constrained routing and scheduling. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Network Routing. Handbooks in Operations Research and Management Science volume 8 (1995), North-Holland 35-139
36. Diana M., and Dessouky M.M. A new regret insertion heuristic for solving largescale dial-a-ride problems with time windows. Transportation Research Part B: Methodological 38 6 (2004) 539-557
37. Feb. Duhamel C., Potvin J.-Y., and Rousseau J.-M. A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transportation Science 31 1 (1997) 49-59
38. Dumas Y., Desrosiers J., and Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 54 1 (1991) 7-22
39. Dumas Y., Desrosiers J., Gelinas E., and Solomon M.M. An optimal algorithm for the traveling salesman problem with time windows. Operations Research 43 2 (1995) 367-371
40. Easton K., Nemhauser G., and Trick M. Solving the travelling tournament problem: A combined integer programming and constraint programming approach. Practice and Theory of AutomatedTimetabling IV (2003), Springer-Verlag, Amsterdam 100-109
41. Fahle T., Junker U., Karisch S.E., Kohl N., Sellmann M., and Vaaben B. Constraint programming based column generation for crew assignment. Journal of Heuristics 8 1 (2002) 59-81
42. Feillet D., Dejax P., and Gendreau M. Traveling salesman problems with profits. Transportation Science 39 2 (2005) 188
43. Fisher M.L. Optimal solution of vehicle routing problems using minimum K-trees. Operations Research 42 4 (1994) 626-642
44. Fisher M.L., and Jörnsten K.O. Vehicle routing with time windows: Two optimization algorithms. Operations Research 45 3 (1997) 488-492
45. Focacci F., Lodi A., and Milano M. Solving TSP with time windows with constraints. In: De Schreye D. (Ed). Logic Programming - Proceedings of the 1999 International Conference on Logic Programming (1999), MIT Press, Cambridge, MA 515-529
46. Focacci F., Lodi A., and Milano M. Embedding relaxations in global constraints for solving TSP and TSPTW. Annals of Mathematics and Artificial Intelligence 34 (2002) 291-311
47. Focacci F., Lodi A., and Milano M. A hybrid exact algorithm for the TSPTW. INFORMS Journal on Computing 14 4 (2002) 403-417
48. Focacci F., Laburthe F., and Lodi A. Local search and constraint programming. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2003), Kluwer Academic Publishers 369-403
49. Fukasawa R., Lysgaard J., de Aragao M.P., Reis M., Uchoa E., and Werneck R. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. In: Bienstock D., and Nemhauser G. (Eds). Integer Programming and Combinatorial Optimization - IPCO 2004 volume 3064 (2004), Springer-Verlag, Berlin 1-15
50. Gendreau M., Hertz A., and Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 40 6 (1992) 1086-1094
51. Gillet B., and Miller L.R. A heuristic algorithm for the vehicle dispatch problem. Operations Research 22 (1974) 340-349
52. Glover F. Tabu search, part I. ORSA Journal on Computing 1 3 (1989) 190-206
53. Glover F. Tabu search, part II. ORSA Journal on Computing 2 1 (1990) 4-32
54. Glover F. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics 65 1-3 (1996) 223-253
55. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison Wesley
56. In: Gutin G., and Punnen A. (Eds). The Traveling Salesman Problems and its Variations (2002), Kluwer Academic Publishers, Reading
57. Hall R. Vehicle routing software survey. OR/MS Today 31 3 (2004)
58. Hansen P., and Mladenovic N. Variable neighborhood search: Principles and applications. European Journal of Operational Research 130 3 (2001) 449-467
59. Montréal, Québec, Canada. Harvey W.D., and Ginsberg M.L. Limited discrepancy search. In: Mellish C.S. (Ed). Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95) volume 1 (1995), Morgan Kaufmann, Dordrecht 607-615
60. Homberger J., and Gehring H. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162 1 (2005) 220-238
61. ILOG S.A. ILOG Dispatcher 4.0 User's Manual. ILOG S.A., 9 Rue de Verdun, 94253 Gentilly Cedex, France.
62. ILOG S.A. ILOG Solver 6.0 User's Manual. ILOG S.A., 9 Rue de Verdun, 94253 Gentilly Cedex, France.
63. Ioannou G., Kritikos M., and Prastacos G. A greedy look-ahead heuristic for the vehicle routing problem with time windows. Journal of the Operational Research Society 52 5 (2001) 523-537
64. Junger M., Reinelt G., and Rinaldi G. The traveling salesman problem. In: Dell'Amico M., Maffioli F., and Martello S. (Eds). Annotated Bibliographies in Combinatorial Optimization (1997), John Wiley & Sons Wiley Interscience Series in Discrete Mathematics
65. Junker U., Karisch S.E., Kohl N., Vaaben B., Fahle T., and Sellmann M. A framework for constraint programming based column generation. In: Jaffar J. (Ed). 5th International Conference of Principles and Practice of Constraint Programming - CP'99, volume 1713 of Lecture Notes in Computer Science (2004), Springer 261-275
66. chapter 7. Easton G.N.K., and Trick M. CP based branch and price. In: Milano M. (Ed). Constraint and Integer Programming: Toward a Unified Methodology (2004), Springer
67. Kallehauge B., Larsen J., and Madsen O.B. Lagrangean duality applied on vehicle routing with time windows. Technical Report IMM-TR-2001-9, IMM, Technical University of Denmark, DK-2800 Kgs. Lyngby - Denmark (2001)
68. September. Kilby P., Prosser P., and Shaw P. Dynamic VRPs: A study of scenarios. APES Technical Report APES-06-1998 (1998), Department of Computer Science, Strathclyde University
69. Kilby P., Prosser P., and Shaw P. A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Constraints 5 4 (2000) 389-414
70. Korte B., and Vygen J. Combinatorial Optimization: Theory and Algorithms, volume 21 of Algorithms and Combinatorics. 2nd edition (2002), Springer, Glasgow, Scotland
71. Kuhn H.W. The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2 (1955) 83-97
72. Laporte G. The traveling salesman problem: an overview of exact and approximate algorithms. European Journal of Operational Research 59 (1992) 231-247
73. Laporte G. The routing problem: An overview of exact and approximate algorithms. European Journal of Operations Research 59 (1992) 345-358
74. Laporte G., and Nobert Y. Comb inequalities for the vehicle routing problem. Methods of Operations Research 51 (1984) 271
75. Laporte G., Nobert Y., and Desrouchers M. Optimal routing with capacity and distance restrictions. Operations Research 33 (1985) 1050
76. Laporte G., Gendreau M., Potvin J.-Y., and Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7 4-5 (2000) 285-300
77. Larsen A., Madsen O.B.G., and Solomon M.M. The a priori dynamic traveling salesman problem with time windows. Transportation Science 38 4 (2004) 459
78. Lawler E.L., Lenstra J.K., Kan A.H.G.R., and Shmoys D.B. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985), John Wiley and Sons, Berlin
79. Le Bouthillier A., and Crainic T.G. A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research 32 7 (2005) 1685-1708
80. Letchford A.N., and Salazar-González J.-J. Projection results for vehicle routing. Mathematical Programming 105 2 (2006) 251-274
81. Lin S. Computer solutions of the traveling salesman problem. Bell Systems Technical Journal 44 (1965) 2245-2269
82. Lobjois L., Lemaître M., and Verfaillie G. Large neighbourhood search using constraint propagation and greedy reconstruction for valued CSP resolution. ECAI Workshop on "Modelling and Solving Problems with Constraints" (14th European Conference on Artificial Intelligence, ECAI 2000). Berlin, Germany, 20-25 August 2000 (2000), ECAI, Chichester
83. Lu Q., and Dessouky M. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science 38 4 (2004) 503
84. Lysgaard J., Letchford A.N., and Eglese R.W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100 2 (2004) 423-445
85. Naddef D., and Rinaldi G. Branch and cut. In: Toth P., and Vigo D. (Eds). Vehicle Routing, volume 9 of SIAM Monographs on Discrete Mathematics and Applications (2000), SIAM
86. Or I. Travelling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood-Banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwest University, Evanston, IL. (1976)
87. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41 (1993) 421-451
88. Padberg M., and Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33 (1991) 60
89. Pesant G., and Gendreau M. A view of local search in constraint programming. In: Freuder E.C. (Ed). Principles and Practice of Constraint Programming - CP96, volume 1118 of Lecture Notes in Computer Science (1996), Springer 353-366
90. Pesant G., Gendreau M., Potvin J., and Rousseau J. An exact constraint logic programming algorithm for the travelling salesman with time windows. Transportation Science 32 1 (1998)
91. Pesant G., Gendreau M., Potvin J.-Y., and Rousseau J.-M. On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem. European Journal of Operational Research 117 2 (1999) 253-263
92. Polacek M., Hartl R.F., Doerner K., and Reimann M. A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics 10 6 (2004) 613-627
93. Potvin J.-Y., and Rousseau J.-M. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operations Research 66 (1993) 331-340
94. Puget J.-F. Object oriented constraint programming for transportation problems. Proceedings of Advanced Software Technology in Air Transport ASTAIR'92. London (1992), Royal Aeronautical Society
95. Regin J.-C. A filtering algorithm for constraints of difference in CSPs. Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), Volume 1 (1994), AAAI 362-367
96. Rego C., and Roucairol C. Parallel tabu search heuristic based on ejection chains for the vehicle routing problem. In: Osman I., and Kelly J. (Eds). Metaheuristics: Theory and Applications (1996), Kluwer Academic Publishers
97. Ribeiro C.C., and Soumis F. A column generation approach to the multiple-depot vehicle scheduling problem. Operations research 42 1 (1994) 41-52
98. S. Ropke and D. Pisinger. A unified heuristic for vehicle routing problems with backhauls. European Journal of Operational Research. To appear.
99. Rousseau L.-M., Gendreau M., and Pesant G. Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics 8 1 (2002) 43-58
100. Rousseau L.-M., Gendreau M., Pesant G., and Focacci F. Solving VRPTWs with constraint programming based column generation. Annals of Operations Research 130 (2004) 199-216
101. Ryan D.M., and Falkner J.C. On the integer properties of scheduling set partitioning models. European Journal of Operational Research 35 3 (1988) 442-456
102. Savelsbergh M. Local search in routing problems with time windows. Annals of Operations Research 4 (1985) 285-305
103. Savelsbergh M.W.P. The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing 4 2 (1992) 146-154
104. Schulze J., and Fahle T. A parallel algorithm for the vehicle routing problem with time window constraints. Annals of Operations Research 86 (1999) 585-607
105. Sellmann M., Zervoudakis K., Stamatopoulos P., and Fahle T. Crew assignment via constraint programming: Integrating column generation and heuristic tree search. Annals of Operations Research 115 1 (2002) 207-225
106. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M., and Puget J.-F. (Eds). Fourth International Conference on Principles and Practice of Constraint Programming (CP '98) (1998), Springer-Verlag
107. Solomon M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research 35 (1987) 254-265
108. Sontrop H., van der Horn P., and Uetz M. Fast ejection chain algorithms for vehicle routing with time windows. In: Blesa M.J., Blum C., Roli A., and Sampels M. (Eds). Hybrid Metaheuristics, volume 3636 of Lecture Notes in Computer Science (2005), Springer-Verlag 78-89
109. Taillard E., Badeau P., Gendreau M., Guertain F., and Potvin J.-Y. A new neighbourhood structure for the vehicle routing problem with time windows. Technical Report CRT-95-66, Centre de Recherche sur les Transports, University of Montreal (1995)
110. Taillard É.D., Badeau P., Gendreau M., Guertin F., and Potyin J. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 (1997) 170-186
111. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem, volume 9 of SIAM Monographs on Discrete Mathematics and Applications (2002), SIAM, Berlin
112. Toth P., and Vigo D. The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing 15 4 (2003) 333-346
113. Van Breedam A. Improvement heuristics for the vehicle routing problem based on simulated annealing. European Journal of Operational Research 86 3 (1995) 480-490
114. Van Hentenryck P., Deville Y., and Teng C. A generic arc consistency algorithm and its specializations. Artificial Intelligence 57 (1992) 291-321
115. Wolsey L.A., and Nemhauser G.L. Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization (1999), Wiley-Interscience
116. Xu H., Chen Z., Rajagopal S., and Arunapuram S. Solving a practical pickup and delivery problem. Transportation Science 37 3 (2003) 347-364