Pricing routines for vehicle routing with time windows on road networks

Computers and Operations Research

Volumn 51, Issue , 2014, Pages 331-337

  Letchford, Adam N ^a   Nasiri, Saeideh D ^a   Oukil, Amar ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b SULTAN QABOOS UNIVERSITY   (Oman)

Author keywords

Bi criteria shortest paths; Combinatorial optimization; Vehicle routing

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; MOTOR TRANSPORTATION; VEHICLE ROUTING;

ALTERNATIVE PATH; BRANCH-AND-PRICE ALGORITHMS; EXACT ALGORITHMS; QUICKEST PATHS; SHORTEST PATH; THEORY AND PRACTICE; VEHICLE ROUTING PROBLEMS; VEHICLE ROUTING WITH TIME WINDOWS;

GRAPH THEORY;

EID: 84904867922     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.06.022     Document Type: Article

References (39)

1. M.P. de Aragão, H. Longo, and E. Uchoa Solving capacitated arc routing problem using a transformation to the CVRP Comput Oper Res 33 2006 1823 1837 (Pubitemid 41525712)
2. N. Ascheuer, M. Fischetti, and M. Grötschel Solving the asymmetric traveling salesman problem with time windows by branch-and-cut Math Progr 90 2001 475 506 (Pubitemid 33758918)
3. Ball MO, Magnanti TL, Monma CL, Nemhauser GL, editors. Network routing. Handbooks in operations research and management science, vol. 8. Elsevier; 1995.
4. E. Baker An exact algorithm for the time-constrained traveling salesman problem Oper Res 31 1983 938 945 (Pubitemid 14489287)
5. R. Baldacci, A. Mingozzi, and R. Roberti New route relaxation and pricing strategies for the vehicle routing problem Oper Res 59 2011 1269 1283
6. R. Baldacci, A. Mingozzi, and R. Roberti New state-space relaxations for solving the traveling salesman problem with time windows INFORMS J Comput 24 2012 356 371
7. C. Bode, and S. Irnich Cut-first branch-and-price-second for the capacitated arc-routing problem Oper Res 60 2012 1167 1182
8. A. Chabrier Vehicle routing problem with elementary shortest path based column generation Comput Oper Res 33 2006 2972 2990 (Pubitemid 43199835)
9. A. Corberán, A.N. Letchford, and J.M. Sanchis A cutting plane algorithm for the general routing problem Math Progr 90 2001 291 316 (Pubitemid 33758926)
10. Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F. VRP with time windows. In: Toth P, Vigo D, editors. The vehicle routing problem, SIAM monographs on discrete mathematics and applications, vol. 9, Philadelphia, PA; 2002. p. 157-93.
11. G. Cornuéjols, J. Fonlupt, and D. Naddef The traveling salesman on a graph and some related integer polyhedra Math Progr 33 1985 1 27 (Pubitemid 15583725)
12. S. Dash, O. Günluk, A. Lodi, and A. Tramontani A time bucket formulation for the traveling salesman problem with time windows INFORMS J Comput 24 2012 132 147
13. G. Desaulniers, F. Lessard, and A. Hadjar Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle with time windows Transp Sci 42 2008 387 404
14. J. Desrosiers, F. Soumis, and M. Desrochers Routing with time windows by column generation Networks 14 1984 545 565 (Pubitemid 14663841)
15. M. Desrochers Vehicle routing with time windows: optimization and approximation B.L. Golden, A.A. Assad, Vehicle routing: methods and studies 1988 Elsevier North Holland
16. M. Desrochers, J. Desrosiers, and M.M. Solomon A new optimization algorithm for the vehicle routing problem with time windows Oper Res 40 1992 342 354
17. Desrosiers J, Dumas Y, Solomon MM, Soumis F. Time-constrained routing and scheduling. In: Ball MO, et al., editors. Network models. Handbooks in operations research and management science, vol. 8; 1995. p. 35-139.
18. M. Dror Note on the complexity of the shortest path models for column generation in VRPTW Oper Res 42 1994 977 979
19. M. Dror Arc routing: theory, solutions and applications 2000 Kluwer Academic Publishers
20. Y. Dumas, J. Desrosiers, É. Gelinas, and M.M. Solomon An optimal algorithm for the traveling salesman problem with time windows Oper Res 43 1995 367 371
21. D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen An exact algorithm for the elementary shortest path problem with resource constraints application to some vehicle routing problems Networks 44 2004 216 229 (Pubitemid 39301560)
22. B. Fleischmann A cutting plane procedure for the traveling salesman problem on a road network Eur J Oper Res 21 1985 307 317 (Pubitemid 15566217)
23. T. Garaix, C. Artigues, D. Feillet, and D. Josselin Vehicle routing problems with alternative paths an application to on-demand transportation Eur J Oper Res 204 2010 62 75
24. B.L. Golden, and A. Assad Vehicle routing: methods and studies 1988 Amsterdam North-Holland
25. Golden BL, Raghavan S, Wasil EA, editors. The vehicle routing problem: latest advances and new challenges. Series in operations research/computer science interfaces, vol. 43. Berlin: Springer; 2008.
26. P. Hansen Bicriterion path problems G. Fandel, T. Gal, Multiple criteria decision making: theory and applications, Lectures notes in economics and mathematical systems vol. 177 1980 Springer Heidelberg
27. S. Irnich, and D. Villeneuve The shortest-path problem with resource constraints and k-cycle elimination for k ≥' 3 INFORMS J Comput 18 2006 391 406 (Pubitemid 44376263)
28. M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger Subset-row inequalities applied to the vehicle-routing problem with time windows Oper Res 56 2008 497 511
29. B. Kallehauge, J. Larsen, and O.B.G. Madsen Lagrangian duality applied to the vehicle routing problem with time windows Comput Oper Res 33 2006 1464 1487 (Pubitemid 41428302)
30. N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis 2-Path cuts for the vehicle routing problem with time windows Transp Sci 33 1999 101 116 (Pubitemid 129723026)
31. A.N. Letchford, S.D. Nasiri, and D.O. Theis Compact formulations of the Steiner traveling salesman problem and related problems Eur J Oper Res 228 2013 83 92
32. A.N. Letchford, and A. Oukil Exploiting sparsity in pricing routines for the capacitated arc routing problem Comput Oper Res 36 2009 2320 2327
33. J. Lysgaard Reachability cuts for the vehicle routing problem with time windows Eur J Oper Res 175 2006 210 223 (Pubitemid 44470717)
34. C.S. Orloff A fundamental problem in vehicle routing Networks 4 1974 35 64
35. G. Pesant, M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau An exact constraint logic programming algorithm for the traveling salesman problem with time windows Transp Sci 32 1999 12 29
36. A. Raith, and M. Ehrgott A comparison of solution strategies for biobjective shortest path problems Comput Oper Res 36 2009 1299 1331
37. M.W.P. Savelsbergh Local search in routing problems with time windows Ann Oper Res 4 1985 285 305
38. M.M. Solomon Algorithms for vehicle routing and scheduling problems with time window constraints Oper Res 35 1987 254 265
39. P. Toth, and D. Vigo The vehicle routing problem 2002 SIAM Publications Philadelphia