论文信息 - Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas

Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas

Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with time-dependent edge weights. This is the first hierarchical speedup technique for time-dependent routing that allows bidirectional query algorithms.

Peter Sanders | P. Sanders

[1] Leo Liberti,et al. Bidirectional A* Search for Time-Dependent Fast Paths , 2008, WEA.

[2] Peter Sanders,et al. Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm , 2008, JEAL.

[3] Dominik Schultes,et al. Route Planning in Road Networks , 2008 .

[4] Daniel Delling. Time-Dependent SHARC-Routing , 2008, ESA.

[5] Peter Sanders,et al. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[6] Daniel Delling,et al. SHARC: Fast and robust unidirectional routing , 2008, JEAL.

[7] K. Cooke,et al. The shortest route through a network with time-dependent internodal transit times , 1966 .

[8] Robert L. Smith,et al. Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..