LU Feng.Shortest path algorithms; Taxonomy and advance in research[J].Acta Ceodaetica et Cartographica Sinica,2001,30(3):269～275.[陆锋.最短路径算法:分类体系与研究进展[J].测绘学报,2001,30(3):269～275.]
[2]
LU Feng,LU Dong-mei,GUI Wei-hong.Improved Dijkstra algorithm based on quad-heap priority queue and inverse adjacent list[J].Journal of Image and Graphics,1999,4A(12):1044～1050.[陆锋,卢冬梅,崔伟宏.基于四叉堆优先级队列及逆邻接表的改进型Dijkstra算法[J].中国图象图形学报,1999,4A(12):1044～1050.]
[3]
Goldberg A V,Harrelson C.Computing the Shortest Path:A * Search Meets Graph Theory[R].MSR-TR-2004-24,Microsoft Research,Microsoft Corporation,Redmond,WA,USA,2003.
LIU B.Route finding by using knowledge about the road networks[J].IEEE Transactions on Systems,Man and Cybernetics,1997,27(4):436～448.
[6]
CAR A,FRANK A U.General Principles of Hierarchical Spatial Reasoning-The Case of Wayfinding[A].In ; Proceedings of the Conference on Spatial Data Handling (SDH 94)[C],Edinburgh,Scotland,UK,1994,2:646～664.
[7]
LU Feng,ZHOU Chen-hu,WAN Qing.An optimum vehicular path algorithm for traffic network based on hierarchical spatial reasoning[J].Journal of Whuhan Technical University of Surveying and Mapping,2000,25(3):226～232.[陆锋,周成虎,万庆.基于层次空间推理的交通网络行车最优路径算法[J].武汉测绘科技大学学报,2000,25(3):226～232.]
[8]
Cao W,Wang S,Jiang Q,et al.A practical implementation of route finding[A].In ; The 4th International Symposium on Mobile Mapping Technology[C],Kuming,China,March 29-31,2004.
[9]
Jing N,Huang Y W,Rundensteiner E A.Hierarchical encoded path views for path query processing:An optimal model and its performance evaluation[J].IEEE Transactions on Knowledge and Data Engineering,1998,10(3):409～431.
[10]
LI De-ren,LI Qing-quan,XIE Zhi-ying,et al.The technique integration of spatial information and mobile communication[J].Geomatics and Information Science of Wuhan University,2002,27(1):1～8.[李德仁,李清泉,谢志颖等.论空间信息与移动通信的集成[J].武汉大学学报？信息科学版,2002,27(1); 1～8.]
[11]
Zhan F B,Noon C E.Shortest path algorithms; An evaluation using real road networks[J].Transportation,1998,32(1):65～73.
[12]
Yue Yang,Gong Jian-ya.An efficient implementation of shortest path algorithm based on Dijkstra algorithm[J].Journal of Wuhan Technical University of Surveying and Mapping,1999,24(3):209～212.[乐阳,龚健雅.Dijkstra最短路径算法的一种高效率实现[J].武汉测绘科技大学学报,1999,24(3):209～212.]
[13]
Wang Jie-chen,Mao Hai-cheng,Yang De-zhi.United structure of point-arc for network graph and its application in GISs shortest path searching[J].Acta Geodaetica et Cartographica Sinica,2000,2000,29(1):47～51.[王杰臣,毛海城,杨得志.图的节点-弧段联合结构表示法及其在GIS最优路径选取中的应用[J].测绘学报,2000,29(1):47～51.]
[14]
Zheng Nian-bo,LI Qing-quan,XU Jing-hai,et al.A bidirectional heuristic shortest path algorithm with turn prohibitions and delays[J].Geomatics and Information Science of Wuhan University,2006,31(3):256～259.[郑年波,李清泉,徐静海等.基于转向限制和延误的双向启发式最短路径算法[J].武汉大学学报？信息科学版,2006,3(3):256～259.]
[15]
Jagadeesh G R,Srikanthan T,Quek K H.Heuristic techniques for accelerating hierarchical routing on road networks[J].IEEE Transactions on Intelligent Transportation System,2002,3 (4):301～309.
