Cheapest paths in dynamic networks

Flows over time problems relate to finding optimal flows over a capacitated network where transit times on network arcs are explicitly considered. In this article, we study the problem of determining a minimum cost origin‐destination path where the cost and the travel time of each arc depend on the time taken to travel from the origin to that particular arc along the path. We provide computational complexity results for this problem and an exact solution algorithm based on an enumeration scheme on the corresponding time expanded network. Finally, we show the efficiency of our approach through a number of experimental tests. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(1), 23–32 2017

[1]  Andrea Pacifici,et al.  Minimum cost paths over dynamic networks , 2016, Electron. Notes Discret. Math..

[2]  Jeffrey Xu Yu,et al.  Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs , 2014, Proc. VLDB Endow..

[3]  Konrad Reif,et al.  Computation of the optimal value function in time‐dependent networks , 2013, Networks.

[4]  Leo Liberti,et al.  Bidirectional A* search on time‐dependent road networks , 2012, Networks.

[5]  Péter Kovács,et al.  LEMON - an Open Source C++ Graph Template Library , 2011, WGT@ETAPS.

[6]  Horst W. Hamacher,et al.  Algorithms for time-dependent bicriteria shortest path problems , 2006, Discret. Optim..

[7]  Brian C. Dean,et al.  Algorithms for minimum‐cost paths in time‐dependent networks with waiting policies , 2004, Networks.

[8]  Gianpaolo Oriolo,et al.  An approximate A* algorithm and its application to the SCS problem , 2003, Theor. Comput. Sci..

[9]  Franck Bousquet,et al.  Road Infrastructure Concession Practice in Europe , 1999 .

[10]  Chak-Kuen Wong,et al.  Time-varying shortest path problems with constraints , 1997, Networks.

[11]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[12]  A. Philpott.  Continuous-Time Shortest Path Problems and Linear Programming , 1994 .

[13]  A. I. Mees,et al.  A FINITE-TIME ALGORITHM FOR SHORTEST PATH PROBLEMS WITH TIME-VARYING COSTS* , 1993 .

[14]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[15]  Ariel Orda,et al.  Minimum weight paths in time-dependent networks , 1991, Networks.

[16]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[17]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[18]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[19]  Ebrahim Nasrabadi,et al.  Dynamic shortest path problems with time-varying costs , 2010, Optim. Lett..

[20]  Konrad Reif,et al.  private communication , 1969 .

[21]  P. Mirchandani,et al.  Column generation for the multicommodity min-cost flow over time problem , 2009 .

[22]  Robert L. Smith,et al.  Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..

[23]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .