The Edge Set Cost of the Vehicle Routing Problem with Time Windows

References

• Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59:1269–1283.Link, Google Scholar
• Belenguer J-M, Benavent E, Prins C, Prodhon C, Wolfler Calvo R (2011) A branch-and-cut method for the capacitated location-routing problem. Comput. Oper. Res. 38:931–941.Crossref, Google Scholar
• Blander Reinhardt L, Pisinger D (2011) Multi-objective and multi-constraint non-additive shortest path problems. Comput. Oper. Res. 38:605–616.Crossref, Google Scholar
• Christofides N, Mingozzi A, Toth P (1981) State-space relaxation procedures for the computation of bounds to routing problems. Networks 11:145–164.Crossref, Google Scholar
• Cook W, Rich JL (1999) A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Technical report, Rice University, Houston.Google Scholar
• Dantzig GB, Ramser JR (1959) The truck dispatching problem. Management Sci. 6:80–91.Link, Google Scholar
• Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42:387–404.Link, Google Scholar
• Desaulniers G, Desrosiers J, Ioachim J, Solomon IM, Soumis F, Villeneuve D (1998) A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Crainic TG, Laporte G, eds. Fleet Management and Logistics (Kluwer, Nowell, MA), 57–93.Crossref, Google Scholar
• Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40:342–354.Link, Google Scholar
• Dror M (1994) Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. 42:977–978.Link, Google Scholar
• Fukasawa R, Longo H, Lysgaard J, Poggi de Aragao M, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106:491–511.Crossref, Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56:497–511.Link, Google Scholar
• Kallehauge B (2008) Formulations and exact algorithms for the vehicle routing problem with time windows. Comput. Oper. Res. 35:2307–2330.Crossref, Google Scholar
• Kallehauge B, Larsen J, Madsen OBG (2006) Lagrangian duality applied to the vehicle routing problem with time windows. Comput. Oper. Res. 33:1464–1487.Crossref, Google Scholar
• Kohl N, Desrosiers J, Madsen OBG, Solomon MM, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33:101–116.Link, Google Scholar
• Kolen AWJ, Rinnooy Kan AHG, Trienekens HWJM (1987) Vehicle routing with time windows. Oper. Res. 35:266–273.Link, Google Scholar
• Letchford AN, Eglese RW, Lysgaard J (2002) Multistarts, partial multistars and the capacitated vehicle routing problem. Math. Programming 94:21–40.Crossref, Google Scholar
• Lysgaard J (2003) CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Working paper 02-05, Department of Management Science and Logistics, Aarhus School of Business, Aarhus University, Aarhus, Denmark.Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming Serie A 100:423–445.Crossref, Google Scholar
• Nagy G, Salhi S (2007) Location-routing: Issues, models and methods. Eur. J. Oper. Res. 177:649–672.Crossref, Google Scholar
• Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3:255–273.Crossref, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35:254–265.Link, Google Scholar