Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Discrete Optimization

Volumn 3, Issue 3, 2006, Pages 255-273

  Righini, Giovanni ^a   Salani, Matteo ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Column generation; Dynamic programming; Shortest path; Vehicle routing

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; RESOURCE ALLOCATION;

COLUMN GENERATION; SHORTEST PATH; VEHICLE ROUTING;

PROBLEM SOLVING;

EID: 33746329306     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.05.007     Document Type: Article

References (13)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows (1993), Prentice Hall
2. Beasley J.E., and Christofides N. An algorithm for the resource constrained shortest path problem. Networks 19 (1989) 379-394
3. Boland N., Dethridge J., and Dumitrescu I. Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Operations Research Letters 34 (2006) 58-68
4. J. Bramel, D. Simchi-Levi, Set-covering-based algorithms for the capacitated VRP, in: P. Toth, D. Vigo (Eds), The Vehicle Routing Problem, in: SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2002
5. Desaulniers G., Desrosiers J., Ioachim I., Solomon M.M., Soumis F., and Villeneuve D. A unified framework for deterministic time constrained Vehicle Routing and crew scheduling Problems. In: Crainic T.G., and Laporte G. (Eds). Fleet Management and Logistics (1998), Kluwer, Boston 57-93
6. Desrochers M., and Soumis F. A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR 26 (1988) 191-212
7. Desrosiers J., Dumas Y., Solomon M., and Soumis F. Time constrained routing and scheduling in Network Routing. In: Ball M.O., et al. (Ed). Handbooks in Operations Research and Management Science (1995), Elsevier Science
8. Desrosiers J., Pelletier P., and Soumis F. Plus court chemin avec contraintes d'horaires. RAIRO 17 (1983) 357-377
9. Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research 42 (1994) 977-978
10. Dumitrescu I., and Boland N. Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42 (2003) 135-153
11. Feillet D., Dejax P., Gendreau M., and Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44 (2004) 216-229
12. S. Irnich, G. Desaulniers, Shortest path problems with resource constraints, Cahier du GERAD G-2004-11, Université de Montréal, 2004
13. Mehlhorn K., and Ziegelmann M. Resource constrained shortest paths. Lecture Notes in Computer Science 1879 (2000) 326-337