An exact solution framework for a broad class of vehicle routing problems

Computational Management Science

Volumn 7, Issue 3, 2010, Pages 229-268

  Baldacci, Roberto ^a   Bartolini, Enrico ^b   Mingozzi, Aristide ^a   Roberti, Roberto ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Dual ascent; Set partitioning; Valid inequalities; Vehicle routing

Indexed keywords

EID: 77954084040     PISSN: 1619697X     EISSN: 16196988     Source Type: Journal    
DOI: 10.1007/s10287-009-0118-3     Document Type: Article

References (55)

1. Augerat P (1995) Approche polyédrale du problème de tournées de véhicules. PhD thesis, Institut National Polytechnique de Grenoble.
2. Augerat P, Belenguer JM, Benavent E, Corberán A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report 1 RR949-M, ARTEMIS-IMAG, Grenoble, France.
3. Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math Program Ser A 120(2): 347-380.
4. Baldacci R, Hadjiconstantinou EA, Mingozzi A (2004a) An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper Res 52: 723-738.
5. Baldacci R, Maniezzo V, Mingozzi A (2004b) An exact method for the car pooling problem based on lagrangean column generation. Oper Res 52: 422-439.
6. Baldacci R, Bodin LD, Mingozzi A (2006) The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput Oper Res 33: 2667-2702.
7. Baldacci R, Toth P, Vigo D (2007) Recent advances in vehicle routing exact algorithms. 4OR: Q J Oper Res 5(4): 269-298.
8. Baldacci R, Battarra M, Vigo D (2008a) Routing a heterogeneous fleet of vehicles. In: Golden BL, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin.
9. Baldacci R, Christofides N, Mingozzi A (2008b) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Program Ser A 115(2): 351-385.
10. Baldacci R, Bartolini E, Mingozzi A (2009a) An exact algorithm for the pickup and delivery problem with time windows (submitted).
11. Baldacci R, Bartolini E, Mingozzi A, Valletta A (2009b) An exact algorithm for the period routing problem (submitted).
12. Baldacci R, Mingozzi A, Roberti R (2009c) Solving the vehicle routing problem with time windows using new state space relaxation and pricing strategies (submitted).
13. Baldacci R, Mingozzi A, Roberti R (2009d) New benchmarks results for the capacitated vehicle routing problem. Working paper.
14. Boschetti MA, Mingozzi A, Ricciardelli S (2004) An exact algorithm for the simplyfied multi depot crew scheduling problem. Ann Oper Res 127: 177-201.
15. Braysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 39(1): 119-139.
16. Braysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp Sci 39(1): 104-118.
17. Chao IM, Golden BL, Wasil E (1995) An improved heuristic for the period vehicle-routing problem. Networks 26(1): 25-44.
18. Choi E, Tcha DW (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comput Oper Res 34: 2080-2095.
19. Christofides N, Beasley JE (1984) The period routing problem. Networks 14: 237-256.
20. Christofides N, Eilon S (1969) An algorithm for the vehicle dispatching problem. Oper Res Q 20: 309-318.
21. Christofides N, Mingozzi A (1989) Vehicle routing: practical and algorithmic aspects. In: van Rijn CFH (eds) Logistics: where ends have to meet. Pergamon Press, New York, pp 30-48.
22. Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 315-338.
23. Christofides N, Mingozzi A, Toth P (1981a) Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation. Math Program 10: 255-280.
24. Christofides N, Mingozzi A, Toth P (1981b) State-space relaxation procedures for the computation of bounds to routing problems. Networks 11: 145-164.
25. Christofides N, Mingozzi A, Toth P (1981c) Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Math Program 20(20): 255-282.
26. Cordeau J-F, Laporte G, Savelsbergh MWP, Vigo D (2007) Vehicle routing. In: Barnhart C, Laporte G (eds) Transportation, handbooks in operations research and management science, vol 14. Elsevier, Amsterdam, pp 367-428.
27. Cordeau J-F, Laporte G, Ropke S (2008) Recent models and algorithms for one-to-one pickup and delivery problems. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin, pp 327-357.
28. Crevier B, Cordeau JF, Laporte G (2007) The multi-depot vehicle routing problem with inter-depot routes. Eur J Oper Res 176: 756-773.
29. Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transp Sci 42(3): 387-404.
30. Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle-routing problem with time windows. Oper Res 40(2): 342-354.
31. Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54(1): 7-22.
32. Francis PM, Smilowitz KR, Tzur M (2008) The period vehicle routing problem and its extensions. In: Golden BL, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin.
33. Fukasawa R, Longo H, Lysgaard J, Poggi de Aragão M, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program Ser A 106: 491-511.
34. Gendreau M, Laporte G, Potvin J-Y (2002) Metaheuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problemm, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 129-154.
35. Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper Res 56(2): 497-511.
36. Laporte G, Semet F (2002) Classical heuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 109-128.
37. Laporte G, Nobert Y, Arpin D (1984) Optimal solutions to capacitated multi depot vehicle routing problems. Congressus Numerantium 44: 283-292.
38. Laporte G, Nobert Y, Taillefer S (1988) Solving a family of multi-depot vehicle routing and location-routing problems. Transp Sci 22: 161-172.
39. Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: 13th IEEE international conference on tools with artificial intelligence, ICTAI-2001, Dallas, USA.
40. Lu Q, Dessouky M (2004) An exact algorithm for the multiple vehicle pickup and delivery problem. Transp Sci 38(4): 503-514.
41. Lysgaard J (2003) CVRPSEP: a package of separation routines for the capacitated vehicle routing problem. Technical report, Dept. of Mgt. Science and Logistics, Aarhus School of Business.
42. Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program Ser A 100: 423-445.
43. Mingozzi A, Christofides N, Hadjiconstantinou EA (1994) An exact algorithm for the vehicle routing problem based on the set partitioning formulation. Technical report, University of Bologna.
44. Mingozzi A, Giorgi S, Baldacci R (1999) An exact method for the vehicle routing problem with backhauls. Transp Sci 33(3): 315-329.
45. Mourgaya M, Vanderbeck F (2006) The periodic vehicle routing problem: classification and heuristic. Rairo-Oper Res 40(2): 169-194.
46. Niskanen S, Östergård PRJ (2003) Cliquer user's guide. Technical Report 48, Helsinki University of Technology Communications Laboratory.
47. Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems part II: transportation between pickup and delivery locations. J Betriebswirtschaft 51: 81-117.
48. Pessoa A, Poggi de Aragão M, Uchoa E (2007) A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Lecture notes in computer science, vol 4525. Springer, Berlin, pp 150-160.
49. Ropke S, Cordeau J-F (2009) Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transp Sci (Forthcoming).
50. Ropke S, Cordeau JF, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4): 258-272.
51. Russel RA, Gribbin D (1991) A multiphase approach to the period routing problem. Networks 21: 747-765.
52. Russel RA, Igo W (1979) An assignment routing problem. Networks 9: 1-17.
53. Savelsbergh MWP, Sol M (1998) Drive: dynamic routing of independent vehicles. Oper Res 46(4): 474-490.
54. Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with the time window constraints. Oper Res 35: 254-265.
55. Toth, P, Vigo, D (eds) (2002) The vehicle routing problem. Monographs on discrete mathematics and applications. SIAM, Philadelphia.