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

DOI10.1016/J.INS.2013.07.009zbMATH Open1320.68221OpenAlexW2076500189MaRDI QIDQ497898FDOQ497898

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

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

Recommendations

• Time-dependent route planning
• Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
• Minimum time-dependent travel times with contraction hierarchies
• Core routing on dynamic time-dependent road networks
• The time-dependent quickest path problem: properties and bounds

zbMATH Keywords

shortest pathroad networkrouting

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• PRMLT
• Pattern recognition and machine learning.
• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• On a routing problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• A Theorem on Boolean Matrices
• The shortest route through a network with time-dependent internodal transit times
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Title not available (Why is that?)
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Title not available (Why is that?)
• Time-varying shortest path problems with constraints
• Shortest paths in a network with time-dependent flow speeds
• An Improved Bidirectional Heuristic Search Algorithm
• Engineering Highway Hierarchies

Cited In (6)

• A novel index method for \(K\) nearest object query over time-dependent road networks
• Title not available (Why is that?)
• A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
• Finding traffic-aware fastest paths in spatial networks
• Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
• Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks

Uses Software

• Algorithm 97
• heapsort
• PRMLT

This page was built for publication: Processing time-dependent shortest path queries without pre-computed speed information on road networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497898)