Citation: | ZHANG Guanxiang, ZHOU Xing, CAI Wenxue, ZHONG Huiling, XU Jing. Design and Implementation of Path Planning System Based on Improved Highway-Hierarchical Algorithm[J]. Journal of Southwest Jiaotong University, 2013, 26(5): 949-954. doi: 10.3969/j.issn.0258-2724.2013.05.026 |
邹亮,徐建闽. 空间数据挖掘在基于GIS的交通诱导系统中的应用[J].华南理工大学学报:自然科学版,2004,32(增刊1): 129-132. ZOU Liang, XU Jianmin. Application of spatial data mining in the transportation guidance system based on GIS[J]. Journal of South China University of Technology: Natural Science, 2004, 32(S1): 129-132.
|
朱弘戈. 基于交通网络数据集的动态路径诱导系统规划与实现探讨[J]. 交通标准化,2011(7): 196-202. ZHU Hongge. Dynamicroute guidance system planning and realization based on traffic network data set[J].Transport Standardization, 2011(7): 196-202.
|
章权,温惠英,孙博. 适于配送车辆导航路径规划的遍历模型的改进型粒子群优化算法[J]. 华南理工大学学报:自然科学版,2011,39(8): 109-117. ZHANG Quan, WEN Huiying, SUN Bo. Improved particle swarm optimization algorithm of ergodic model for routing planning of delivery vehicle navigation[J]. Journal of South China University of Technology: Natural Science, 2011, 39(8): 109-117.
|
温惠英,徐建闽,林正春. 适于物流配送车辆导航路径优化的遗传算法[J]. 华南理工大学学报:自然科学版,2009,37(2): 82-91. WEN Huiying, XU Jianmin, LIN Zhengchun. Genetic algorithm for route optimization of vehicle navigation in logistics distribution[J]. Journal of South China University of Technology: Natural Science, 2009, 37(2): 82-91.
|
HART P E, NILSSON N J, RAPHAEL B. A formal basis for the heuristic determination of minimum cost paths[J]. IEEE Transactions on System Science and Cybernetics, 1968, 4(2): 100-107.
|
LO W, ZWICKER M. Bidirectional search for interactive motion synthesis[J]. Computer Graphics Forum, 2010, 29(2): 563-573.
|
GOLDBERG A V,HARRELSON C. Computing the shortest path:A* meets graph theory.Technical Report MSR-TR-2004-24, Microsoft Research, 2004.
|
GOLDBERG A V, HARRELSON C. Computing the shortest path: A* meets graph theory[C]//16th ACM-SIAM Symposium on Discrete Algorithms. Vancouver:[s.n.], 2005: 156-165.
|
GOLDBERG A V, WERNECK R F. Computing point-to-point shortest paths from external memory[C]//Workshop on Algorithm Engineering and Experiments (ALENEX). Vancouver:[s.n.], 2005: 26-40.
|
SCHULZ F, WAGNER D, ZAROLIAGIS C D. Using multi-level graphs for timetable information in railway systems[C]//Workshop on Algorithm Engineering and Experiments(ALENEX).[S.l.]: Springer Berlin Heidelberg, 2002: 43-59.
|
MULLER K. Design and implementation of an efficient hierarchical speed-up technique for computation of exact shortest paths in graphs[D]. Karlsruhe: Universität Karlsruhe(TH), 2006.
|
SCHULTES D. Fast and exact shortest path queries using highway hierarchies[D]. Saarbrücken: Universität des Saarlandes, 2005.
|
SCHULTES D, Route planning in road networks[D]. Karlsruhe: Universität Karlsruhe(TH), 2008.
|
BAST H, FUNKE S, SANDERS P, et al. Fast routing in road networks with transit nodes[J]. Sience, 2007, 316: 566-566.
|
SOMMER C. Approximate shortest path and distance queries in networks[D]. Tokyo: The University of Tokyo, 2010.
|
郑烟武. 基于分层分区的动态路径规划算法研究[D]. 广州: 华南理工大学,2011.
|
HOLZER M, SCHULZ F, WILLHALM T. Combining speed-up techniques for shortest-path computations[C]//3rd International Workshop on Experimental and Efficient Algorithms(WEA).[S.l.]: Springer-Verlag, 2004: 269-284.
|
DELLING D, SANDERS P, SCHULTES D, et al. Highway hierarchies star[DB/OL].[2012-04-12] http:[C]//arrival.cti.gr/index.php/Documents/0011.
|
严商. 基于WCF的分布式程序的研究与实现[D].武汉:武汉理工大学,2008.
|
周兴. 面向Internet的动态路径规划算法研究与应用系统设计[D].广州:华南理工大学经济与贸易学院,2011.
|
于加晴,查建中,陆一平,等. 基于SOA 的分布式并行协同设计架构[J]. 北京交通大学学报,2009,33(5): 69-72. YU Jiaqing, CHA Jianzhong, LU Yiping, et al. Research on the distributed concurrent and collaborative design architecture based on SOA[J]. Journal of Beijing Jiaotong University, 2009, 33(5): 69-72.
|
周劲,刘洋,蔺永政. 一种基于Web Service的分布式应用系统的设计[J]. 计算机应用研究,2007(2): 238-239. ZHOU Jing, LIU Yang, LIN Yongzheng. Design of distributed application system based on Web service[J]. Application Research of Computers,2007(2): 238-239.
|
LOWY J. Programming WCF services[M]. Sebastopol: O'Reilly Press, 2007: 120-200.
|