Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
暂无分享,去创建一个
Natashia Boland | Edward He | Martin Savelsbergh | George Nemhauser | H. Milton Stewart | G. Nemhauser | M. Savelsbergh | N. Boland | E. He
[1] Michael Poss,et al. Time‐dependent shortest paths with discounted waits , 2019, Networks.
[2] Subhash Suri,et al. On the Complexity of Time-Dependent Shortest Paths , 2011, Algorithmica.
[3] Yang Du,et al. Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[4] K. Nachtigall. Time depending shortest-path problems with applications to railway networks , 1995 .
[5] Jeffrey Xu Yu,et al. Finding time-dependent shortest paths over large graphs , 2008, EDBT '08.
[6] Miguel A. Figliozzi,et al. The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics , 2012 .
[7] Xiaofang Zhou,et al. Minimal On-Road Time Route Scheduling on Time-Dependent Graphs , 2017, Proc. VLDB Endow..
[8] Ismail Chabini,et al. Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .
[9] K. Cooke,et al. The shortest route through a network with time-dependent internodal transit times , 1966 .
[10] Martin W. P. Savelsbergh,et al. The Continuous-Time Service Network Design Problem , 2017, Oper. Res..
[11] B. C. Dean. Shortest Paths in FIFO Time-Dependent Networks : Theory and Algorithms , 2004 .
[12] Amelia Regan,et al. On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints , 2009, Comput. Ind. Eng..
[13] Eric V. Denardo,et al. Flows in Networks , 2011 .
[14] Sanjeeb Dash,et al. A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows , 2012, INFORMS J. Comput..
[15] Farnoush Banaei Kashani,et al. Online Computation of Fastest Path in Time-Dependent Spatial Networks , 2011, SSTD.
[16] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[17] de Ag Ton Kok,et al. Analysis of Travel Times and CO2 Emissions in Time‐Dependent Vehicle Routing , 2012 .
[18] Ariel Orda,et al. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.
[19] N. S. Barnett,et al. Private communication , 1969 .