Heuristic shortest path algorithms for transportation applications: State of the art

By Liping Fu, Dihua Sun, L. Rilett. Computers & Operations Research, 2006

356 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Map-matching for low-sampling-rate GPS trajectories (2009, neutral): “Definition 3 (Road Segment): A road segment 𝑒 is a directed edge that is associated with an id 𝑒. 𝑒𝑖𝑑 , a typical travel speed 𝑒. 𝑣 , a length value 𝑒. 𝑙, a starting point 𝑒. 𝑠𝑡𝑎𝑟𝑡, an ending point 𝑒. 𝑒𝑛𝑑 and a list of intermediate points that describes the road using a polyline.”
Exact Routing in Large Road Networks Using Contraction Hierarchies (2012, methodology): “Previous heuristic approaches, e.g., Fu, Sun, and Rilett (2006), or speedup techniques based on A ∗ , e.g., Klunder and Post (2006), are orders of magnitude slower than the best exact methods known now.”
Route Planning in Transportation Networks (2015, methodology): “[130] give an overview of early approaches using this technique.”
Finding shortest paths on real road networks: the case for A* (2009, methodology): “For more details than we provide here, the interested reader should consult Gallo and Pallottino (1986), Cherkassky et al. (1993), Dreyfus (1969) and Fu et al. (2006).”