A survey of resource constrained shortest path problems: Exact solution approaches

Networks

Volumn 62, Issue 3, 2013, Pages 183-200

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

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

elementary path; forbidden path; resource constraints; shortest path

Indexed keywords

CONSTRAINED SHORTEST PATH; ELEMENTARY PATH; EXACT SOLUTION; FORBIDDEN PATHS; RESOURCE CONSTRAINT; SCIENTIFIC LITERATURE; SHORTEST PATH;

SURVEYS;

GRAPH THEORY;

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

References (79)

1. A. V. Aho, and, M. J. Corasick, Efficient string matching: An aid to bibliographic search, Commun ACM 18 (1975), 333-340.
2. Y.P. Aneja, V. Aggarwal, and, K.P.K. Nair, Shortest chain subject to side constraints, Networks 13 (1983), 295-302. (Pubitemid 13558786)
3. P. Avella, M. Boccia, and, A. Sforza, A penalty function heuristic for the resource constrained shortest path problem, Eur J Oper Res 142 (2002), 221-230. (Pubitemid 34803129)
4. R. Baldacci, M. Aristide, and, R. Roberti, New route relaxation and pricing strategies for the vehicle routing problem, Oper Res 59 (2011), 1269-1283.
5. C. Barnhart, N. Boland, L.W. Clarke, E.L. Johnson, G.L. Nemhauser, and, R.G. Shenoi, Flight string models for aircraft fleeting and routing, Transport Sci 32 (1998), 208-220. (Pubitemid 128585426)
6. J.E. Beasley, and, N. Christofides, An algorithm for the resource constrained shortest path problem, Networks 19 (1989), 379-394.
7. 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. (Pubitemid 41688319)
8. E.A. Cabral, Wide area telecommunication network design: Problems and solution algorithms with application to the Alberta supernet, Ph.D thesis, University of Alberta, Edmonton, Alberta, Canada. AAINR08210, 2005.
9. E.A. Cabral, E. Erkut, G. Laporte, and, R.A. Petterson, The network design problem with relays, Eur J Oper Res 180 (2010), 834-844. (Pubitemid 46199065)
10. W.M. Carlyle, J.O. Royset, and, R.K. Wood, Lagrangian relaxation and enumeration for solving constrained shortest-path problems, Networks 52 (2008), 256-270.
11. A. Ceselli, G. Righini, and, M. Salani, A column generation algorithm for a rich vehicle-routing problem, Transport Sci 43 (2009), 56-69.
12. A. Chabrier, Vehicle routing problem with elementary shortest path based column generation, Comput Oper Res 33 (2006), 2972-2990. (Pubitemid 43199835)
13. N. Christofides, A. Mingozzi, and, P. Toth, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Math Program 20 (1981), 255-282. (Pubitemid 12508234)
14. J.F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, and, F. Soumis, "VRP with time windows," SIAM Monographs on Discrete Mathematics and Applications, P. Toth, D. Vigo, (Editors), Philadelphia, PA, 2002, pp. 157-194.
15. 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 (2006), 235-247.
16. E.V. Denardo, and, B.L. Fox, Shortest-route methods: 1. reaching, pruning and buckets, Oper Res 27 (1979), 161-186.
17. G. Desaulniers, J. Desrosiers, I. Ioachim, M. Solomon, F. Soumis, and, D. Villeneuve, "A unified framework for deterministic time constrained vehicle routing and crew scheduling problems" Fleet Management and Logistics, T. Crainic and, G. Laporte, (Editors), Kluwer Academic, Boston, 1998, pp. 57-93.
18. G. Desaulniers, F. Lessard, and, A. Hadjar, Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows, Transport Sci 42 (2008), 387-404.
19. M. Desrochers, An algorithm for the shortest path problem with resource constraints, Technical report G-88-27, École des hautes études commerciales (Montréal, Québec), Les Cahiers du GERAD, 1988.
20. 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.
21. M. Desrochers, and, F. Soumis, A generalized permanent labelling algorithm for the shortest path problems with time windows, INFOR 26 (1988), 193-214.
22. M. Desrochers, and, F. Soumis, A column generation approach to the urban transit crew scheduling problem, Transport Sci 23 (1989), 1-13.
23. J. Desrosiers, P. Pelletier, and, F. Soumis, Plus court chemin avec contraintes d'horaires, RAIRO-Rech Oper 17 (1983), 357-377, in French.
24. L. Di Puglia Pugliese, and, F. Guerriero, A computational study of solution approaches for the resource constrained elementary shortest path problem, Ann Oper Res 201 (2012), 131-157.
25. L. Di Puglia Pugliese, and, F. Guerriero, A reference point approach for the resource constrained shortest path problems, Transport Sci (in press). DOI: 10.1287/trsc.1120.0418.
26. L. Di Puglia Pugliese, and, F. Guerriero, Dynamic programming approaches to solve the shortest path problem with forbidden paths, Optim Method Softw 28 (2013), 221-255.
27. L. Di Puglia Pugliese, and, F. Guerriero, Shortest path problem with forbidden paths: The elementary version, Eur J Oper Res (in press). DOI: 10.1016/j.ejor.2012.11.010.
28. E.W. Dijkstra, A note on two problems in connexion with graphs, Numer Math 1 (1959), 269-271.
29. M. Dror, Note on the complexity of the shortest path models for column generation in VRPTW, Oper Res 42 (1994), 977-978.
30. I. Dumitrescu, and, N. Boland, Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem, Networks 42 (2003), 135-153.
31. D. Feillet, P. Dejax, and, M. Gendreau, Traveling salesman problems with profits, Transport Sci 39 (2005), 188-205. (Pubitemid 40748589)
32. 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)
33. B.L. Fox, and, D.M. Landi, Searching for the multiplier in one-constraint optimization problems, Oper Res 18 (1970), 253-262.
34. G. Gallo, and, S. Pallottino, Shortest path algorithms, Ann Oper Res 13 (1988), 1-79.
35. M.R. Garey, and, D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman & Co, New York, NY, 1990.
36. F. Glover, R. Glover, and, D. Klingman, The threshold shortest path algorithm, Networks 14 (1984), 25-36.
37. E. Gutiérrez, and, A.L. Medaglia, Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks, Ann Oper Res 157 (2008), 169-182.
38. G. Gutierrez-Jarpa, G. Desaulniers, G. Laporte, and, V. Marianov, A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows, Eur J Oper Res 206 (2010), 341-349.
39. J. Halpern, and, I. Priess, Shortest paths with time constraints on movement and parking, Networks 4 (1974), 241-253.
40. G.Y. Handler, and, I. Zang, A dual algorithm for the constrained shortest path problem, Networks 10 (1980), 293-309.
41. K. Holmberg, and, D. Yuan, A multicommodity network-flow problem with side constraints on paths solved by column generation, INFORMS J Comput 15 (2003), 42-57. (Pubitemid 39042732)
42. D.J. Houck, J.C. Picard, M. Queyranne, and, R.R. Vemuganti, The travelling salesman problem as a constrained shortest path problem: Theory and computational experience, OPSEARCH 17 (1980), 93-109.
43. I. Ioachim, S. Gélinas, F. Soumis, and, J. Desrosiers, A dynamic programming algorithm for the shortest path problem with time windows and linear node costs, Networks 31 (1998), 193-204.
44. S. Irnich, Resource extension functions: Properties, inversion and generalization to segments, OR Spectrum 30 (2008), 113-148.
45. S. Irnich, and, G. Desaulniers, "Shortest path problems with resource constraints," Column Generation, G. Desaulniers, J. Desrosiers, and, M. M. Solomon, (Editors), Springer, US, 2005, pp. 33-65.
46. 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)
47. 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.
48. J.K. Kelley, Jr., The cutting-plane method for solving convex programs, J Soc Ind Appl Math 8 (1960), 703-712.
49. N. Kohl, Exact methods for time constrained routing and related scheduling problems, Ph.D thesis, Informatics and Mathematical Modelling, Technical University of Denmark, DTU, Lyngby, 1995.
50. N. Kohl, O.B.G. Madsen, An optimization algorithm for the vehicle routing problem with time windows based on Lagrangean relaxation, Oper Res 45 (1997), 395-406. (Pubitemid 127684717)
51. G. Laporte, and, M.M.B. Pascoal, Minimum cost path problems with relays, Comput Oper Res 38 (2011), 165-173.
52. G. Laporte, and, M.M.B. Pascoal, The pipeline and valve location problem, Eur J Ind Eng 6 (2012), 301-321.
53. F. Liberatore, G. Righini, and, M. Salani, A column generation algorithm for the vehicle routing problem with soft time windows, 4OR-Q J Oper Res 9 (2011), 49-82.
54. E.Q.V. Martins, An algorithm for ranking paths that may contain cycles, Eur J Oper Res 18 (1984), 123-130.
55. K. Mehlhorn, and, M. Ziegelmann, Resource constrained shortest paths, 8 t h Ann Eur Symp on Algorithms (ESA2000, LNCS, Saarbrücken, Germany 1879 (2000), 326-337.
56. A. Mingozzi, M.A. Boschetti, S. Ricciardelli, and, L. Bianco, A set partitioning approach to the crew scheduling problem, Oper Res 47 (1999), 873-888. (Pubitemid 30594274)
57. A. Moghaddam, F. Yalaoui, and, L. Amodeo, "Lorenz versus Pareto dominance in a single machine scheduling problem with rejection, EMO," Lecture Notes in Computer Science, Vol. 6576, R.H.C. Takahashi, K. Deb, E.F. Wanner, and, S. Greco, (Editors), Springer Berlin, Heidelberg, 2011, pp. 520-534.
58. R. Muhandiramge, and, N. Boland, Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem, Networks 53 (2009), 358-381.
59. P. Perny, O. Spanjaard, and, L. Storme, A decision-theoretic approach to robust optimization in multivalued graphs, Ann Oper Res 147 (2006), 317-341. (Pubitemid 44496812)
60. W.B. Powell, and, Z.L. Chen, "A generalized threshold algorithm for the shortest path problem with time windows," Network design: Connectivity and facilities, P.M. Panalos and, D. Du, (Editors), American Mathematical Soc., Providence, RI, 1998, pp. 303-318.
61. A.G. Qureshi, E. Taniguchi, and, T. Yamada, An exact solution approach for vehicle routing and scheduling problems with soft time windows, Transport Res E-LOG 45 (2009), 960-977.
62. C.C. Ribeiro, and, M. Minoux, A heuristic approach to hard constrained shortest path problems, Discrete Appl Math 10 (1985), 125-137.
63. G. Righini, and, M. Salani, Symmetry helps: Bounded bidirectional dynamic-programming for the elementary shortest path problem with resource constraints, Discrete Optim 3 (2006), 255-273. (Pubitemid 44118875)
64. G. Righini, and, M. Salani, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks 51 (2008), 155-170.
65. G. Righini, and, M. Salani, Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming, Comput Oper Res 36 (2009), 1191-1203.
66. S. Ropke, and, J.F. Cordeau, Branch and cut and price for the pickup and delivery problem with time windows, Transport Sci 43 (2009), 267-286.
67. M. Salani, and, I. Vacca, Branch and price for the vehicle routing problem with discrete split deliveries and time windows, Eur J Oper Res 213 (2011), 470-477.
68. L. Santos, J. Coutinho-Rodrigues, and, J.R. Current, An improved solution algorithm for the constrained shortest path problem, Transport Res B-Meth 41 (2007), 756-771. (Pubitemid 46655556)
69. O.J. Smith, N. Boland, and, H. Waterer, Solving shortest path problems with a weight constraint and replenishment arcs, Comput Oper Res 39 (2012), 964-984.
70. M. Tagmouti, M. Gendreau, and, J.Y. Potvin, Arc routing problems with time-dependent service costs, Eur J Oper Res 181 (2007), 30-39.
71. P. Toth, and, D. Vigo, "Capacitated Vehicle Routing Problems", The vehicle routing problem," SIAM Monographs on Discrete Mathematics and Applications, P. Toth and, D. Vigo, (Editors), Philadelphia, PA, 2002, pp. 27-49.
72. P. Vansteenwegen, W. Souffriau, and, D. VanOudheusden, The orienteering problem: A survey, Eur J Oper Res 209 (2011), 1-10.
73. D. Villeneuve, and, G. Desaulniers, The shortest path problem with forbidden paths, Eur J Oper Res 165 (2005), 97-107. (Pubitemid 40135596)
74. W.E. Wilhelm, I. Arambula, and, N.D. Choudhry, Optimizing picking operations on dual-head placement machines, IEEE Trans Autom Sci Eng 3 (2006), 1-15. (Pubitemid 46404968)
75. W.E. Wilhelm, N.D. Choudhry, and, P. Damodaran, A model to optimize placement operations on dual-head placement machines, Discrete Optim 4 (2007), 232-256. (Pubitemid 46551951)
76. W.E. Wilhelm, P. Damodaran, and, J. Li, Prescribing the content and timing of product upgrades, IIE Trans 35 (2003), 647-663.
77. M. Zabarankin, S. Uryasev, and, P. Pardalos, "Optimal risk path algorithms," cooperative control and optimization, R. Murphey and, P.M. Pardalos, (Editors), Springer, US, 2002, pp. 273-298.
78. X. Zhu, and, W.E. Wilhelm, Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context, Eur J Oper Res 183 (2007), 564-577. (Pubitemid 46891134)
79. X. Zhu, and, W.E. Wilhelm, A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation, Comput Oper Res 39 (2012), 164-178.