private communication

In this paper, we consider time-dependent networks, and the task of computing cost-optimal paths, which are constrained to stay close to fastest paths. We derive pruning criteria, which significantly improve both the number of vertex-time pairs expanded during search and the memory required to ensure the correctness of any solution algorithm. We then prove new complexity results, which imply that the problem of computing constrained cost-optimal paths in a discrete-time setting is polynomially solvable for several graph and constraint classes.

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

[2]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[3]  Xiaoqiang Cai,et al.  Time-varying shortest path problems with constraints , 1997 .

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

[5]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[6]  Chelsea C. White,et al.  Optimal vehicle routing with real-time traffic information , 2005, IEEE Transactions on Intelligent Transportation Systems.

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

[8]  F. Kelly.  Network routing , 1991, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.

[9]  Carlos F. Daganzo,et al.  Reversibility of the Time-Dependent Shortest Path Problem , 1998 .

[10]  Maria Grazia Scutellà,et al.  Dynamic shortest paths minimizing travel times and costs , 2001, Networks.

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

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

[13]  Deep Medhi,et al.  Network routing - algorithms, protocols, and architectures , 2007 .

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

[15]  E. Polak,et al.  Theory of optimal control and mathematical programming , 1969 .

[16]  L. B. Fu,et al.  Expected Shortest Paths in Dynamic and Stochastic Traf c Networks , 1998 .

[17]  Soondal Park,et al.  Shortest paths in a network with time-dependent flow speeds , 1998, Eur. J. Oper. Res..

[18]  Brian C. Dean,et al.  Continuous-time dynamics shortest path algorithms , 1999 .

[19]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[20]  O. Junge,et al.  A set oriented approach to global optimal control , 2004 .

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

[22]  Song Gao,et al.  Optimal routing policy problems in stochastic time-dependent networks , 2006 .

[23]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[24]  Dorothea Wagner,et al.  Time-Dependent Route Planning , 2009, Encyclopedia of GIS.

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

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

[27]  Song Gao,et al.  Optimal routing policy problems in stochastic time-dependent networks. I. Framework and taxonomy , 2002, Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems.

[28]  Maciej Liskiewicz,et al.  The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes , 2003, Theor. Comput. Sci..

[29]  Song Gao,et al.  Optimal routing policy problems in stochastic time-dependent networks. II. Exact and approximation algorithms , 2002, Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems.