Shortest paths in a network with time-dependent flow speeds

DOI10.1016/S0377-2217(99)00035-1zbMath0959.90009OpenAlexW2050560064MaRDI QIDQ1969888

Myeongki Seong, Kiseok Sung, Soondal Park, Michael G. H. Bell

Publication date: 19 March 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00035-1

zbMATH Keywords

shortest path problemtime-dependent networksnon-passing property

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

The time-dependent shortest path and vehicle routing problem ⋮ The impact of time aggregation and travel time models on time-dependent routing solutions ⋮ Shortest paths in time-dependent FIFO networks ⋮ Accurate calculation of hazardous materials transport risks. ⋮ Determining time-dependent minimum cost paths under several objectives ⋮ Processing time-dependent shortest path queries without pre-computed speed information on road networks ⋮ A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling ⋮ Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge ⋮ Computation of the optimal value function in time-dependent networks ⋮ Finding least fuel emission paths in a network with time-varying speeds ⋮ On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds

Cites Work

• Unnamed Item
• Unnamed Item
• The shortest route through a network with time-dependent internodal transit times
• On a routing problem
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length