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

This article surveys the main contributions that have appeared in the scientific literature addressing resource constrained shortest path problems. The aim of this work is twofold: to give a structured survey of the literature on this topic; to provide a starting point for researchers who want to address the problems at hand. The study is focused on the relevant contributions dealing with exact solution approaches. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(3), 183-200 2013

[1]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[2]  Warren B. Powell,et al.  A generalized threshold algorithm for the shortest path problem with time windows , 1997, Network Design: Connectivity and Facilities Location.

[3]  Edgar Alberto Cabral.  Wide area telecommunication network design: problems and solution algorithms with application to the alberta supernet , 2005 .

[4]  Celso C. Ribeiro,et al.  A heuristic approach to hard constrained shortest path problems , 1985, Discret. Appl. Math..

[5]  Jonathan Halpern,et al.  Shortest path with time constraints on movement and parking , 1974, Networks.

[6]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[7]  Raymond A. Patterson,et al.  The network design problem with relays , 2007, Eur. J. Oper. Res..

[8]  N. Boland,et al.  Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem , 2009 .

[9]  E. Martins.  An algorithm for ranking paths that may contain cycles , 1984 .

[10]  Luigi Di Puglia Pugliese,et al.  Dynamic programming approaches to solve the shortest path problem with forbidden paths , 2013, Optim. Methods Softw..

[11]  Guy Desaulniers,et al.  The shortest path problem with forbidden paths , 2002, Eur. J. Oper. Res..

[12]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..

[13]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[14]  Matteo Salani,et al.  Branch and price for the vehicle routing problem with discrete split deliveries and time windows , 2011, Eur. J. Oper. Res..

[15]  Stefan Irnich.  Resource extension functions: properties, inversion, and generalization to segments , 2008, OR Spectr..

[16]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

[17]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

[18]  Xiaoyan Zhu,et al.  Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context , 2007, Eur. J. Oper. Res..

[19]  Patrice Perny,et al.  A decision-theoretic approach to robust optimization in multivalued graphs , 2006, Ann. Oper. Res..

[20]  Xiaoyan Zhu,et al.  A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation , 2012, Comput. Oper. Res..

[21]  Giovanni Righini,et al.  Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming , 2009, Comput. Oper. Res..

[22]  Pasquale Avella,et al.  A penalty function heuristic for the resource constrained shortest path problem , 2002, Eur. J. Oper. Res..

[23]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[24]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[25]  Niklas Kohl,et al.  Exact methods for time constrained routing and related scheduling problems , 1995 .

[26]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.

[27]  Natashia Boland,et al.  Solving shortest path problems with a weight constraint and replenishment arcs , 2012, Comput. Oper. Res..

[28]  Guy Desaulniers,et al.  Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows , 2006, Transp. Sci..

[29]  Michel Gendreau,et al.  Arc routing problems with time-dependent service costs , 2007, Eur. J. Oper. Res..

[30]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[31]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[32]  Giovanni Righini,et al.  A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection , 2006, Transp. Sci..

[33]  Natashia Boland,et al.  Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem , 2003, Networks.

[34]  Luigi Di Puglia Pugliese,et al.  Shortest path problem with forbidden paths: The elementary version , 2013, Eur. J. Oper. Res..

[35]  Gerhard Reinelt,et al.  The travelling salesman problem , 1995 .

[36]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[37]  Giovanni Righini,et al.  Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..

[38]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[39]  B. L. Fox,et al.  Searching for the Multiplier in One-Constraint Optimization Problems , 1970, Oper. Res..

[40]  Andrés L. Medaglia,et al.  Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks , 2008, Ann. Oper. Res..

[41]  Moshe Dror,et al.  Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..

[42]  Kurt Mehlhorn,et al.  Resource Constrained Shortest Paths , 2000, ESA.

[43]  Gilbert Laporte,et al.  A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows , 2009, Eur. J. Oper. Res..

[44]  Eiichi Taniguchi,et al.  An exact solution approach for vehicle routing and scheduling problems with soft time windows , 2009 .

[45]  Gilbert Laporte,et al.  Minimum cost path problems with relays , 2011, Comput. Oper. Res..

[46]  Lionel Amodeo,et al.  Lorenz versus Pareto Dominance in a Single Machine Scheduling Problem with Rejection , 2011, EMO.

[47]  Alain Chabrier,et al.  Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..

[48]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[49]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

[50]  Natashia Boland,et al.  Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..

[51]  Fred W. Glover,et al.  Computational study of an improved shortest path algorithm , 1984, Networks.

[52]  George L. Nemhauser,et al.  Flight String Models for Aircraft Fleeting and Routing , 1998, Transp. Sci..

[53]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[54]  Giorgio Gallo,et al.  Shortest path algorithms , 1988, Handbook of Optimization in Telecommunications.

[55]  J. Current,et al.  An Improved Solution Algorithm for the Constrained Shortest Path Problem , 2007 .

[56]  Giovanni Righini,et al.  A column generation algorithm for the vehicle routing problem with soft time windows , 2011, 4OR.

[57]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[58]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[59]  W. Wilhelm,et al.  Prescribing the Content and Timing of Product Upgrades , 2003 .

[60]  Y. P. Aneja,et al.  Shortest chain subject to side constraints , 1983, Networks.

[61]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .

[62]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[63]  M H Farahi,et al.  AN ALGORITHM FOR THE SHORTEST PATH PROBLEM , 2005 .

[64]  Purushothaman Damodaran,et al.  A model to optimize placement operations on dual-head placement machines , 2007, Discret. Optim..

[65]  P. Pardalos,et al.  Optimal Risk Path Algorithms , 2002 .

[66]  Luigi Di Puglia Pugliese,et al.  A computational study of solution approaches for the resource constrained elementary shortest path problem , 2012, Annals of Operations Research.

[67]  Wilbert E. Wilhelm,et al.  Optimizing picking operations on dual-head placement machines , 2006, IEEE Transactions on Automation Science and Engineering.

[68]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

[69]  R. K. Wood,et al.  Lagrangian relaxation and enumeration for solving constrained shortest-path problems , 2008 .

[70]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[71]  Luigi Di Puglia Pugliese,et al.  A Reference Point Approach for the Resource Constrained Shortest Path Problems , 2013, Transp. Sci..

[72]  Sylvie Gélinas,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1994, Networks.

[73]  Marco A. Boschetti,et al.  A Set Partitioning Approach to the Crew Scheduling Problem , 1999, Oper. Res..

[74]  Giovanni Righini,et al.  A Column Generation Algorithm for a Rich Vehicle-Routing Problem , 2009, Transp. Sci..

[75]  Di Yuan,et al.  A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation , 2003, INFORMS J. Comput..

[76]  J. Desrosiers,et al.  Plus court chemin avec contraintes d'horaires , 1983 .

[77]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[78]  Gilbert Laporte,et al.  The pipeline and valve location problem , 2012 .