New dynamic programming algorithms for the resource constrained elementary shortest path problem

Networks

Volumn 51, Issue 3, 2008, Pages 155-170

  Righini, Giovanni ^a   Salani, Matteo ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Branch and bound; Column generation; Dynamic programming; Shortest path; Vehicle routing

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER NETWORKS; CONTROL THEORY; MATHEMATICAL PROGRAMMING; ROUTING ALGORITHMS; SYSTEMS ENGINEERING; VEHICLE ROUTING; VEHICLES;

BRANCH-AND-BOUND; COLUMN GENERATION; DYNAMIC-PROGRAMMING; SHORTEST PATH; STATE SPACES;

BRANCH AND BOUND METHOD;

EID: 51349129806     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20212     Document Type: Article

References (24)

1. Y. Agarwal, K. Mathur, and H.M. Salkin, A set-partitioning-based exact algorithm for the vehicle-routing problem, Networks 19 (1989), 731-749.
2. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, N.J., 1993.
3. J.E. Beasley and N. Christofides, An algorithm for the resource constrained shortest path problem, Networks 19 (1989), 379-394.
4. N. Boland, J. Dethridge, and I. Dumitrescu, Accelerated label setting algorithms for the elementary resource constrained shortest path problem, Oper Res Lett 34 (2006), 58-68.
5. J. Bramel and D. Simchi-Levi, Set-covering-based algorithms for the capacitated VRP, The vehicle-routing problem, SIAM monographs on discrete mathematics and applications, P. Toth and D. Vigo (Editors), 2002, pp. 85-106.
6. N. Christofides, A. Mingozzi, and P. Toth, State-space relaxation procedures for the computation of bounds to routing problems, Networks 11 (1981), 145-164.
7. J.F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, and F. Soumis, VRP with time windows, The vehicle-routing problem, SIAM monographs on discrete mathematics and applications, P. Toth and D. Vigo (Editors), 2002.
8. M. Dell'Amico, G. Righini, and M. Salani, A branch-and-price approach to the vehicle-routing problem with simultaneous distribution and collection, Transport Sci 40(2), 2006, 235-247.
9. M. Desrochers and F. Soumis, A generalized permanent labelling algorithm for the shortest path problem with time windows, INFOR 26 (1988), 191-212.
10. M. Desrochers, J. Desrosiers, and M. Solomon, A new optimization algorithm for the vehicle-routing problem with time windows, Oper Res 40 (1992), 342-354.
11. M. Desrochers and F. Soumis, A reoptimization algorithm for the shortest path problem with time windows, Eur J Oper Res 35 (1988), 242-254.
12. J. Desrosiers, Y. Dumas, M. Solomon, and F. Soumis, Time constrained routing and scheduling in Network Routing, Handbooks in operations research and management science, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), Elsevier Science, 1995.
13. J. Desrosiers, P. Pelletier, and F. Soumis, Plus court chemin avec contraintes d'horaires, RAIRO 17 (1983), 357-377.
14. M. Dror, Note on the complexity of the shortest path models for column generation in VRPTW, Oper Res 42 (1994), 977-978.
15. I. Dumitresu and N. Boland, Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem, Networks 42 (2003), 135-153.
16. 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.
17. S. Gélinas, M. Desrochers, J. Desrosiers, and M.M. Solomon, A new branching strategy for time constrained routing problems with application to backhauling Cahiers du GERAD G-92-13, HEC Montréal, Montréal, 1992.
18. G.Y. Handler and I. Zang, A dual algorithm for the constrained shortest path problem, Networks 10 (1980), 293-310.
19. S. Irnich and G. Desaulniers, Shortest path problems with resource constraints, Cahier du GERAD G-2004-11, Université de Montréal, Montréal, 2004.
20. S. Irnich and D. Villeneuve, The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3, Cahiers du GERAD G-2003-55, HEC Montréal, Montréal, 2003.
21. 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, Transport Sci 33 (1999), 101-116.
22. A. Mingozzi, L. Bianco, and S. Ricciardelli, Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints, Oper Res 45 (1997), 365-377.
23. G. Righini and M. Salani, Symmetry helps: Bounded bidirectional dynamic-programming for the elementary shortest path problem with resource constraints, Discrete Optimization 3(3), 2006, 255-273.
24. P. Toth and D. Vigo, Capacitated vehicle-routing problems in The vehicle-routing problem, SIAM Monographs on Discrete Mathematics and Applications, P. Toth and D. Vigo (Editors), 2002.