What you should know about the vehicle routing problem

Naval Research Logistics

Volumn 54, Issue 8, 2007, Pages 811-819

  Laporte, Gilbert ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Capacity constraints; Heuristics; Integer linear programming; Metaheuristics; Vehicle routing problem

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; VEHICLE ROUTING;

CAPACITY CONSTRAINTS; INTEGER LINEAR PROGRAMMING; METAHEURISTICS; MILK COLLECTION; VEHICLE ROUTING PROBLEM;

LINEAR PROGRAMMING;

EID: 36549015264     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20261     Document Type: Article

References (62)

1. K. Altinkemer and B. Gavish, Parallel savings based heuristic for the delivery problem, Oper Res 39 (1991), 456-469.
2. D.L. Applegate, R.E. Bixby, V. Chvátal, and W.J. Cook, The traveling salesman problem, A computational study, Princeton University Press, Princeton, NJ, 2007.
3. B.M. Baker and J. Sheasby, Extensions to the generalised assignment heuristic for vehicle routing, Eur J Oper Res 119 (1999), 147-157.
4. E. Balas and M.W. Padberg, Set partitioning: A survey, SIAM Rev 18 (1976), 710-760.
5. R. Baldacci, N. Christofides, and A. Mingozzi, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Math Program Ser A (in press).
6. R. Baldacci, E. Hadjiconstantinou, and A. Mingozzi, An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation, Oper Res 52 (2004), 723-738.
7. M. Balinski and R. Quandt, On an integer program for a delivery problem, Oper Res 12 (1964), 300-304.
8. N. Christofides, A. Mingozzi, and P. Toth, "The vehicle routing problem," in: N. Christofides, A. Mingozzi, P. Toth, and C. Sandi (Editors), Combined optimization, Wiley, Chichester, 1979, pp. 315-338.
9. G. Clarke and J. V. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper Res 12 (1964), 568-581.
10. J.-F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J.-S. Sormany, "New heuristics for the vehicle routing problem," in: A. Langevin and D. Riopel (Editors), Logistics systems and optimization, Springer, New York, 2005, pp. 279-297.
11. J.-F. Cordeau, M. Gendreau, G. Laporte, J.-Y. Potvin, and F. Semet, A guide to vehicle routing heuristics, J Oper Res Soc 53 (2002), 512-522.
12. J.-F. Cordeau, G. Laporte, and A. Mercier, A unified tabu search heuristic for vehicle routing problems with time windows, J Oper Res Soc 52 (2001), 928-936.
13. J.-F. Cordeau, G. Laporte, M.W.P. Savelsbergh, and D. Vigo, "Vehicle routing," in: C. Barnhart and G. Laporte (Editors), Transportation, handbooks in operations research and management science, Vol. 14, Elsevier, Amsterdam, 2007, pp. 367-428.
14. G.B. Dantzig, D.R. Fulkerson, and S.M. Johnson, Solution of a large-scale traveling-salesman problem, Oper Res 2 (1954), 393-410.
15. G.B. Dantzig and J.H. Ramser, The truck dispatching problem, Manag Sci 6 (1959), 80-91.
16. U. Derigs and R. Kaiser, Applying the attribute based hill climber heuristic to the vehicle routing problem, Eur J Oper Res 177 (2007), 719-732.
17. G. Dueck, New optimization heuristics: The great deluge algorithm and the record-to-record travel, J Comput Phy 104 (1993), 86-92.
18. O. Ergun, New neighborhood search algorithms based on exponentially large scale neighborhoods, Ph.D. Thesis, Massachusetts Institute of Technology, 2001.
19. O. Ergun, J.B. Orlin, and A. Steele-Feldman, Creating very large-scale neighbourhoods out of smaller ones by compounding moves, J Heuristics 12 (2006), 115-140.
20. G. A. Finke, A. Claus, and E. Gunn, A two-commodity network flow approach to the traveling salesman problem, Congressus Numerantium 41 (1984), 167-178.
21. M.L. Fisher and R. Jaikumar, A generalized assignment heuristic for the vehicle routing problem, Networks 11 (1981), 109-124.
22. B.A. Foster and D.M. Ryan, An integer programming approach to the vehicle scheduling problem, Oper Res 27 (1976), 367-384.
23. R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa, and R.F. Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Math Program Ser A 106 (2006), 491-511.
24. M. Gendreau, A. Hertz, and G. Laporte, A tabu search heuristic for the vehicle routing problem, Manag Sci 40 (1994), 1276-1290.
25. M. Gendreau, J.-Y. Potvin, O. Bräysy, G. Hasle, and A. Løkketangen, "Meta-heuristics for the vehicle routing problem and its extensions: A categorized bibliography," in: B.L. Golden, S. Raghavan, and E.A. Wasil (Editors), The vehicle routing problem: Latest advances and challenges, Springer, Boston, (in press).
26. H. Ghaziri, "Solving routing problems by a self-organizing map," in: T. Kohonen, K. Makisara, O. Simula, and J. Kangas (Editors), Artificial neural networks, North-Holland, Amsterdam, 1991, pp. 829-834.
27. B.E. Gillett and L.R. Miller, A heuristic algorithm for the vehicle dispatch problem, Oper Res 22 (1974), 340-349.
28. F. Glover, Future paths for integer programming and links to artificial intelligence, Comput Oper Res 13 (1986), 533-549.
29. B.L. Golden, A.A. Assad, and E.A. Wasil, "Routing vehicles in the real world: Applications in the solid waste beverage, food, dairy and newspaper industries," in: P. Toth and D. Vigo (Editors), The vehicle routing problem, SLAM Monographs on discrete mathematics and applications, Society for Industrial and Applied Mathematics, Philadelphia, 2002, pp. 245-286.
30. B.L. Golden, T.L. Magnanti, and H.Q. Nguyen, Implementing vehicle routing algorithms, Networks 7 (1977), 113-148.
31. B.L. Golden, E.A. Wasil, J.P. Kelly, and I-M. Chao, "Metaheuristics in vehicle routing," in: T. G. Crainic and G. Laporte (Editors), Fleet management and logistics, Kluwer, Boston, 1998, pp. 33-56.
32. K. Hoffman and M.W. Padberg, Solving airline crew scheduling problems by branch and cut, Manag Sic 39 (1993), 657-682.
33. J.H. Holland, Adaptation in natural and artificial systems, The University of Michigan Press, Ann Arbor, MI, 1975.
34. G.A.P. Kindervater and M.W.P. Savelsbergh, "Vehicle routing: Handling edge exchanges," in: E.H.L. Aarts and J.K. Lenstra (Editors), Local search in combinatorial Optimization, Wiley, Chichester, 1997, pp. 337-360.
35. J. Kytöjoki, T. Nuortio, O. Bräysy, and M. Gendreau, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Comput Oper Res 34 (2007), 2743-2757.
36. G. Laporte and Y. Nobert, Exact algorithms for the vehicle routing problem, Ann Discrete Math 31 (1987), 147-184.
37. G. Laporte, Y. Nobert, and M. Desrochers, Optimal routing under capacity and distance restrictions, Oper Res 33 (1985), 1058-1073.
38. G. Laporte and F. Semet, "Classical heuristics for the capacitated VRP," in: P. Toth and D. Vigo (Editors), The Vehicle routing problem, SIAM monographs on discrete mathematics and applications, Society for Industrial and Applied Mathematics, Philadelphia, 2002, pp. 109-128.
39. A.N. Letchford, R.W. Eglese, and J. Lysgaard, Multistars, partial multistars and the capacitated vehicle routing problem, Math Progam Ser A 94 (2002), 21-40.
40. F. Li, B.L. Golden, and E.A. Wasil, Very large-scale vehicle routing: New test problems, algorithms, and results, Comput Oper Res 32 (2005), 1165-1179.
41. D. Mester and O. Bräysy, Active guided evolution strategies for the large scale vehicle routing problems with time windows, Comput Oper Res 32 (2005), 1593-1614.
42. D. Mester and O. Bräysy, Active-guided evolution strategies for large-scale capacitated vehicle routing problems, Comput Oper Res 34 (2007), 2964-2975.
43. N. Mladenovic̀ and P. Hansen, Variable neighborhood search, Comput Oper Res 24 (1997), 1097-1100.
44. D. Naddef and G. Rinaldi, "Branch-and-cut algorithms for the capacitated VRP," in: P. Toth and D. Vigo (Editors), The vehicle routing problem, SIAM monographs on discrete mathematics and applications, Society for Industrial and Applied Mathematics, Philadelphia, 2002, pp. 53-81.
45. Y. Nagata, "Edge assembly crossover for the capacitated vehicle routing problem," in: C. Cotta and J. van Hemert (Editors), Lecture notes in computer science, vol. 4446, Springer-Verlag, Berlin Heidelberg, 2007, 142-153.
46. M.D. Nelson, K.E. Nygard, J.H. Griffin, and W.E. Shreve, Implementation techniques for the vehicle routing problem, Comput Oper Res 12 (1985), 273-283.
47. D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Comput Oper Res 34 (2007), 2403-2435.
48. C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Comput Oper Res 31 (2004), 1985-2002.
49. M. Reimann, K. Doerner, and R.F. Haitl, D-Ants: Savings based ants divide and conquer the vehicle routing problem, Comput Oper Res 31 (2004), 563-591.
50. J. Renaud, F.F. Boctor, and G. Laporte, An improved petal heuristic for the vehicle routing problem, J Oper Res Soc 47 (1996), 329-336.
51. Y. Rochat and É.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, J Heuristics 1 (1995), 147-167.
52. D.M. Ryan, C. Hjorring, and F. Glover, Extentions of the petal method for vehicle routing, J Oper Res Soc 44 (1993), 289-296.
53. M. Schumann and R. Retzko, "Self-organizing maps for vehicle routing problems - minimizing an explicit cost function," in: F. Fogelman-Soulie (Editor), Proceedings of the International Conference on Artificial Neural Networks, Paris, 1995, pp. 401-406.
54. É.D. Taillard, Parallel iterative search methods for vehicle routing problem, Networks 23 (1993), 661-673.
55. C.-D. Tarantilis, Solving the vehicle routing problem with adaptive memory programming methodology, Comput Oper Res 32 (2005), 2309-2327.
56. C.-D. Tarantilis and C.T. Kiranoudis, BoneRoute: An adaptive memory-based method for effective fleet management, Ann Oper Res 115 (2002), 227-241.
57. P.M. Thompson and H.M. Psaraftis, Cyclic transfer algorithms for multi-vehicle routing and scheduling problems, Oper Res 41 (1993), 935-946.
58. P. Toth and D. Vigo, "Exact solution of the vehicle routing problem," in: T.G. Crainic and G. Laporte (Editors), Fleet management and logistics Kluwer, Boston, 1998, pp. 1-31.
59. P. Toth and D. Vigo (Editors), The vehicle routing problem, SIAM Monographs on discrete mathematics and applications, Philadelphia, 2002.
60. P. Toth and D. Vigo, The granular tabu search and its application to the vehicle routing problem, INFORMS J Comput 15 (2003), 333-346.
61. A. van Breedam, An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints, Ph. D. Dissertation, University of Antwerp, 1994.
62. P. Wark and J. Holt, A repeated matching heuristic for the vehicle routing problem, J Oper Res Soc 45 (1994), 1156-1167.