A computational study of solution approaches for the resource constrained elementary shortest path problem

Annals of Operations Research

Volumn 201, Issue 1, 2012, Pages 131-157

  Di Puglia Pugliese, Luigi ^a   Guerriero, Francesca ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Dynamic programming; Elementary shortest path; Resource constraints

Indexed keywords

EID: 84870497249     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-012-1162-x     Document Type: Article

References (31)

1. Aneja, Y. P., Aggarwal, V., & Nair, K. P. K. (1983). Shortest chain subject to side constraints. Networks, 13, 295-302.
2. Barnhart, C., Boland, N., Clarke, L., Johnson, E. L., Nemhauser, G. L., & Shenoi, R. G. (1998). Flight string models for aircraft fleeting and routing. Transportation Science, 32, 208-220.
3. Beasley, J. E., & Christofides, N. (1989). An algorithm for the resource constrained shortest path problem. Networks, 19, 379-394.
4. Boland, N., Dethridge, J., & Dumitrescu, I. (2006). Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Operations Research Letters, 34, 58-68.
5. Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996). Shortest paths algorithms: theory and experimental evaluation. Mathematical Programming, 73(2), 129-174.
6. Christofides, N., Mingozzi, A., & Toth, P. (1981). Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Mathematical Programming, 20, 255-282.
7. Cordeau, J. F., Desaulniers, G., Desrosiers, J., Solomon, M. M., & Soumis, F. (2002). VRP with time windows. In P. Toth & D. Vigo (Eds.), The vehicle-routing problem (pp. 157-193).
8. Dell'Amico, M., Righini, G., & Salani, M. (2006). A branch-and-price approach to the vehicle-routing problem with simultaneous distribution and collection. Transportation Science, 40(2), 235-247.
9. Desrochers, M. (1988). An algorithm for the shortest path problem with resource constraints (Technical report G-88-27). GERAD.
10. Desrochers, M., & Soumis, F. (1988). A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR. Information Systems and Operational Research, 26, 191-212.
11. Desrosiers, J., Pelletier, P., & Soumis, F. (1983). Plus court chemin avec constraints d'horaires. RAIRO-Theoretical Informatics and Applications, 17, 357-377 (in French).
12. Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2), 342-354.
13. Dror, M. (1994). Note on the complexity of the shortest path models for column generation in VRPTW. Operational Research, 42, 977-978.
14. Dumitrescu, I., & Boland, N. (2003). Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks, 42(3), 135-153.
15. Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks, 43(3), 216-229.
16. Handler, G. Y., & Zang, I. (1980). A dual algorithm for the constrained shortest path problem. Networks, 10, 293-309.
17. Houck, D. J., Picard, J. C., Queyranne, M., & Vemuganti, R. R. (1980). The travelling salesman problem as a constrained shortest path problem: theory and computational experience. Operational Research, 17, 93-109.
18. Irnich, S. (2008). Resource extension functions: properties, inversion and generalization to segments. OR-Spektrum, 30(1), 113-148.
19. Jaumard, B., Semet, F., & Vovor, T. (1996). A two-phase resource constrained shortest path algorithm for acyclic graphs (Technical report G-96-48). Les Cahier du GERAD.
20. Joksch, H. C. (1966). The shortest route problem with constraints. Journal of Mathematical Analysis and Applications, 14, 191-197.
21. Kohl, N. (1995). Exact methods for time constrained routing and related scheduling problems. PhD thesis, Institute of Mathematical Modelling, Technical University of Denmark, DK-2800 Lyngby. Dissertation no. 16.
22. Lawler, E. L. (1976). Combinatorial optimization: networks and matroids. New York: Holt, Rinehart and Winston.
23. th ann. European symp. on algorithms (ESA2000) (pp. 326-337).
24. Qureshi, A. G., Taniguchi, E., & Yamada, T. (2007). Elementary shortest path problem with resource constraints and time dependent late arrival penalties. Doboku Gakkai Ronbunshuu D, 63(4), 579-590.
25. Righini, G., & Salani, M. (2006). Symmetry helps: bounded bidirectional dynamic-programming for the elementary shortest path problem with resource constraints. Discrete Optimization, 3(3), 255-273.
26. Righini, G., & Salani, M. (2008). New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks, 51(3), 155-170.
27. Righini, G., & Salani, M. (2009). Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Computers & Operations Research, 36, 1191-1203.
28. Santos, L., Coutinho-Rodrigues, J., & Current, J. R. (2007). An improved solution algorithm for the constrained shortest path problem. Transportation Research. Part B, 41, 756-771.
29. Skiscim, C. C., & Golden, B. (1989). Solving the k-shortest and constrained shortest path problem efficiently. Annals of Operations Research, 20, 249-282.
30. Solomon, M. M. (1983). Vehicle routing and scheduling with time window constraints: models and algorithms. PhD thesis, Department of Decision Science, University of Pennsylvania.
31. Toth, P., & Vigo, D. (2002). Capacitated vehicle-routing problems in the vehicle-routing problem. In P. Toth & D. Vigo (Eds.), SIAM monographs on discrete mathematics and applications.