[1]
Fang Hui, Hong Weijun, Shortest Path Algorithm within Dynamic Restricted Searching Area in City Emergency Rescue[J], Journal of Chinese People's Public Security University(Science and Technology), 2010. 4(4): 87-91.
DOI: 10.1109/icemms.2010.5563425
Google Scholar
[2]
Bondy J A, Murty U R. Graph theory with applications [M]. New York: The Macmillan Press, (2003).
Google Scholar
[3]
Fang MeiHong, Liu ShaoHua. The Design and Realization of the shortest path Algorithm Based on VC++. [J] Urban Geotechnical investigation & surveying, 2008. 1: 43-46.
Google Scholar
[4]
Lin X, Shroff N B. Utility maximization for communication networks with multi-path routing[C]. IEEE Trans Automat Contr, 2006: 766-781.
DOI: 10.1109/tac.2006.875032
Google Scholar
[5]
Fu Mengyin, Li jie, Deng Zhihong. A Route Planning Algorithm for the Shortest Distance Within a Restricted Searching Area. [J] Transactions of Beijing Institute of Technology. 2004, 24(10). 881-884.
Google Scholar
[6]
YAN Han-Bing, LIU Ying-Chun. A New Algorithm for Finding Shortcut in a City's Road Net Based on GIS Technology[J]. Chinese Journal of Computers, 2000, 23(2) . 211-215.
Google Scholar
[7]
Benjam in Z F. Three fastest shortest path algorithms on real road networks[J]. Journal of Geographic Information and Decision Analysis, 1997, 1(1): 69- 82.
Google Scholar
[8]
ZHANG Jin-ming, HONG Gang, WEN Rui, et al. Optimization strategies of the Dijkstra's shortest route algorithm[J]. Science of Surveying and Mapping, 2009, 34(5): 105-106.
Google Scholar
[9]
CAO Jiandong, ZHENG Sifa,WANG Jianqiang, et al. Fast synchronous optimization algorithm for pickup and delivery route[J]. Journal of Tsinghua University (Science and Technology), 2008, 48 (8) : 1344-1347.
Google Scholar
[10]
Zhang Fuhao, Liu Jiping. A new shortest path algorithm for massive spatial data based on Dijkstra algorithm[J]. Journal of LiaoNing Technology University: (Natural Science and edition), 2009, 28(4): 554-557.
DOI: 10.1109/fskd.2009.848
Google Scholar