A solution method for the shared resource-constrained multi-shortest path problem

Abstract We tackle the problem of finding, for each network within a collection, the shortest path between two given nodes, while not exceeding the limits of a set of shared resources. We present an integer programming (IP) formulation of this problem and propose a parallelizable matheuristic consisting of three phases: (1) generation of feasible solutions, (2) combination of solutions, and (3) solution improvement. We show that the shortest paths found with our procedure correspond to the solution of some type of scheduling problems such as the Air Traffic Flow Management (ATFM) problem. Our computational results include finding optimal solutions to small and medium-size ATFM instances by applying Gurobi to the IP formulation. We use those solutions to assess the quality of the output produced by our proposed matheuristic. For the largest instances, which correspond to actual flight plans in ATFM, exact methods fail and we assess the quality of our solutions by means of Lagrangian bounds. Computational results suggest that the proposed procedure is an effective approach to the family of shortest path problems that we discuss here.

[1]  Ismail Chabini,et al.  Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .

[2]  R. Bellman.  Dynamic programming. , 1957, Science.

[3]  Matthias Ehrgott,et al.  A comparison of solution strategies for biobjective shortest path problems , 2009, Comput. Oper. Res..

[4]  Y. Aneja,et al.  BICRITERIA TRANSPORTATION PROBLEM , 1979 .

[5]  Armin Scholl,et al.  A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times , 2009 .

[6]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[7]  Laureano F. Escudero,et al.  On air traffic flow management with rerouting. Part I: Deterministic case , 2012, Eur. J. Oper. Res..

[8]  MengChu Zhou,et al.  Recent Advances in Energy-Efficient Routing Protocols for Wireless Sensor Networks: A Review , 2016, IEEE Access.

[9]  Thomas Stützle,et al.  Automatic Algorithm Configuration Based on Local Search , 2007, AAAI.

[10]  Xin Jin,et al.  Planning of Garbage Collection Service: An Arc-Routing Problem With Time-Dependent Penalty Cost , 2021, IEEE Transactions on Intelligent Transportation Systems.

[11]  Martin W. P. Savelsbergh,et al.  Perspectives on integer programming for time-dependent models , 2019, TOP.

[12]  R. Musmanno,et al.  Label Correcting Methods to Solve Multicriteria Shortest Path Problems , 2001 .

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

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

[15]  Antonio Alonso-Ayuso,et al.  A Combinatorial model to optimize air traffic flow management problems , 2019, Comput. Oper. Res..

[16]  Gerhard Friedrich,et al.  Extending the RCPSP for modeling and solving disruption management problems , 2008, Applied Intelligence.

[17]  Tom Van Woensel,et al.  The dynamic shortest path problem with time-dependent stochastic disruptions , 2018, Transportation Research Part C: Emerging Technologies.

[18]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[19]  Rema Padman,et al.  An integrated survey of deterministic project scheduling , 2001 .

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

[21]  Manuel Laguna,et al.  Tabu Search , 1997 .

[22]  Michal Pióro,et al.  On open shortest path first related network optimisation problems , 2002, Perform. Evaluation.

[23]  Lars Lundberg,et al.  A parallel algorithm for train rescheduling , 2018, Transportation Research Part C: Emerging Technologies.

[24]  Leonardo Lozano,et al.  On an exact method for the constrained shortest path problem , 2013, Comput. Oper. Res..

[25]  Ronald G. Askin,et al.  Project selection, scheduling and resource allocation with time dependent returns , 2009, Eur. J. Oper. Res..

[26]  Armin Scholl,et al.  Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling , 1999, Eur. J. Oper. Res..

[27]  James H. Patterson,et al.  ProGen/pix - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions , 2000, Eur. J. Oper. Res..

[28]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[29]  MengChu Zhou,et al.  Dual-Objective Scheduling of Rescue Vehicles to Distinguish Forest Fires via Differential Evolution and Particle Swarm Optimization Combined Algorithm , 2016, IEEE Transactions on Intelligent Transportation Systems.

[30]  Ling Wang,et al.  A multi-agent optimization algorithm for resource constrained project scheduling problem , 2015, Expert Syst. Appl..

[31]  Renan Garcia,et al.  Resource constrained shortest paths and extensions , 2009 .

[32]  Amedeo R. Odoni,et al.  An Integer Optimization Approach to Large-Scale Air Traffic Flow Management , 2011, Oper. Res..

[33]  Robert Klein,et al.  Project scheduling with time-varying resource constraints , 2000 .

[34]  Tamás Kis,et al.  Solving resource constrained shortest path problems with LP-based methods , 2016, Comput. Oper. Res..

[35]  Stefano Giordani,et al.  Finding minimum and equitable risk routes for hazmat shipments , 2007, Comput. Oper. Res..

[36]  Johanna Törnquist,et al.  Computer-based decision support for railway traffic scheduling and dispatching: A review of models and algorithms , 2005, ATMOS.

[37]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

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

[39]  Stefan Helber,et al.  Scheduling resource-constrained projects with a flexible project structure , 2013, Eur. J. Oper. Res..

[40]  Sönke Hartmann,et al.  A survey of variants and extensions of the resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..

[41]  Mauricio G. C. Resende,et al.  A genetic algorithm for the resource constrained multi-project scheduling problem , 2008, Eur. J. Oper. Res..

[42]  Christelle Guéret,et al.  A multi-space sampling heuristic for the green vehicle routing problem , 2016 .

[43]  Johanna Törnquist Krasemann.  Design of an Effective Algorithm for Fast Response to the Rescheduling of Railway Traffic During Disturbances , 2012 .

[44]  Qing Song,et al.  Practical Multicriteria Urban Bicycle Routing , 2017, IEEE Transactions on Intelligent Transportation Systems.

[45]  Nikolai Holeczek,et al.  Hazardous materials truck transportation problems: A classification and state of the art literature review , 2019, Transportation Research Part D: Transport and Environment.

[46]  Giuseppe Confessore,et al.  A market-based multi-agent system model for decentralized multi-project scheduling , 2007, Ann. Oper. Res..

[47]  N. R. Achuthan,et al.  Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm , 2001, Ann. Oper. Res..

[48]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[49]  Chelsea C. White,et al.  The dynamic shortest path problem with anticipation , 2007, Eur. J. Oper. Res..

[50]  Athanasios P. Chassiakos,et al.  Time-Cost Optimization of Construction Projects with Generalized Activity Constraints , 2005 .