最短路径研究综述
最短路径研究综述（转载请联系博主）
大家熟悉的最短路径问题，
最短路径算法的研究，总共分为四个阶段：
第一阶段 理论研究阶段（1958-1999）
1959, Dijkstra Algorithm, Dijkstra,
1963, Bidirectional Search, Dantzig,
1968, A*-Algorithm, Hart et al,
第二阶段 初步加速阶段（1999-2005）
1999, Geometric Containers, Wagner et al
2002, Multi-Level-Algorithm, Wagner et al,
2004, Reach-based Routing, Gutman
第三阶段 工程上加速阶段（2005-2008）
2005, ALT-Algorithm, Goldberg et al., 54ms,13min
2005, Arc-Flag Algorithm, Mohring et al.,1.1ms,35h
2005, Highway Hierarchies, Sanders et al,0.61ms,13min
2007, Transit-Node-Routing, Bast et al.3.4us,2h
2007, Highway-Node-Routing, Sanders et al,0.85ms,15min
第四阶段 工程上加速阶段（2008-至今）
2008, SHARC, Delling et al,0.29ms,1:12h
2008, Contraction Hierarchies, Sanders et al,0.16ms,25min
参考文献
Engineering Route Planning Algorithms, Daniel Delling, etl, Algorithmics of Large and Complex Networks, Lecture Notes in Computer Science. Springer, 2009.
Speed-Up Techniques for Shortest-Path Computations，Dorothea Wagner and Thomas Willhalm, volume 4393 of Lecture Notes in Computer Science, pages 23-36. Springer, 2007.
Contraction Hierarchies: Faster and Simpler. Hierarchical Routing in Road Networks.R Geisberger Diploma Thesis,2008.
Daniel Delling:Engineering and Augmenting Route Planning Algorithms.PhD thesis,2009
Frank Schulz:Timetable information and shortest paths.PhD thesis,2005