Processing time-dependent shortest path queries without pre-computed speed information on road networks

DOI10.1016/j.ins.2013.07.009zbMath1320.68221OpenAlexW2076500189MaRDI QIDQ497898

Hwanjo Yu, Jinoh Oh, Wook-Shin Han, Jinha Kim, Sungchul Kim

Publication date: 25 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.07.009

zbMATH Keywords

shortest pathroutingroad network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items

A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization, Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks, A novel index method for \(K\) nearest object query over time-dependent road networks

Uses Software

• Algorithm 97
• heapsort
• PRMLT

Cites Work

• A note on two problems in connexion with graphs
• PRMLT
• Shortest paths in a network with time-dependent flow speeds
• 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
• An Improved Bidirectional Heuristic Search Algorithm
• Time-varying shortest path problems with constraints
• Fibonacci heaps and their uses in improved network optimization algorithms
• Engineering Highway Hierarchies
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item