[1]CHEN Liang,HE Wei,HAN Liqun.Study on an urban transportation optimal path algorithm[J].CAAI Transactions on Intelligent Systems,2012,7(2):167-173.
Copy

Study on an urban transportation optimal path algorithm

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 7 Number of periods: 2012 2 Page number: 167-173 Column: 学术论文—智能系统 Public date: 2012-04-25
Title:
Study on an urban transportation optimal path algorithm
Author(s):
CHEN Liang;  HE Wei;  HAN Liqun
College of Computer and Information Engineering, Beijing Commercial and Industrial University, Beijing 100048, China
Keywords:
intelligent transportation;  graph theory;  routing algorithm optimization;  optinal path
CLC:
TP391.4
DOI:
-
Abstract:
In urban intelligent transportation systems, the optimal path algorithm and its optimization are hot topic and the core of the whole transportation system. By introducing the shortest path algorithm in graph theory, this paper first researched the accessible paths for the urban transportation along with an optimization algorithm. Next, by using the path cost function, an optimal path algorithm for urban transportation was proposed. On this basis, by optimizing the search area, the search direction for accessible paths, and the road network hierarchical search optimization strategy, the goal of optimizing urban paths was attained. The proposed optimal urban path and its optimization algorithm were able to provide several timeoptimal pedestrian paths for references. Through practical applications, the validity and realtime characteristics of the proposed urban optimal path and its optimization algorithm were verified. 
References:
［1］DIJKSTRA E W. A note on two problems in connection with graphs［J］. Numerische Mathematik, 1959(1): 269271.
［2］ZHAO Yilin. Vehicle location and navigation system［M］. Boston: Artech House, 1997: 16102.
［3］张渭军,王华. 城市道路最短路径的Dijkstra算法优化［J］. 长安大学学报：自然科学版, 2005, 25(6): 6265.
 ZHANG Weijun, WANG Hua. Optimation Dijkstra arithmetic for shortest path of urban traffic net［J］. Journal of Chang’an University: Natural Science Edition, 2005, 25(6): 6265.
［4］姜桂艳, 郑祖舵. 基于记忆机制的动态交通路径优化算法［J］. 吉林大学学报：工程技术版, 2007, 37(5): 10431048.
JIANG Guiyan, ZHENG Zuduo. Dynamic traffic path optimization algorithm based on mnemonic mechanism［J］. Journal of Jilin University: Engineering and Technology Edition， 2007, 37(5): 10431048.
［5］梁磊.两点间所有路径的遍历算法［J］. 科技信息, 2010, 25(33): 8687.
 LIANG Lei. All paths between two points of traversal algorithm［J］. Science and Technology Information, 2010, 25(33): 8687.
［6］谭浩强.C+〖KG-*1/3〗+面向对象程序设计［M］. 北京：清华大学出版社, 2006: 2560.
［7］严蔚敏，吴伟民. 数据结构［M］. 北京：清华大学出版社, 2003: 18190.
［8］任刚, 王炜. 交通建模中的最短路径算法研究综述［C］//第一届中国交通地理信息系统技术研讨会.武汉，中国， 2007: 165173.
 REN Gang, WANG Wei. Survey on shortest path algorithms in transportation modeling［C］//The First Session of the China Communications Symposium Geographic Information System Technology. Wuhan, China, 2007: 165173.
［9］CALDWELL T. On finding minimum routes in a network with turn penalties［J］. Communication of the ACM, 1961, 4(2): 107108.
［10］陈亮, 何为, 韩力群. RBF神经网络的行车路径代价函数建模［J］. 智能系统学报, 2011, 6(5): 424431.
 CHEN Liang, HE Wei, HAN Liqun. Radial basis function neural network modeling of the traffic path cost function［J］. CAAI Transactions on Intelligent Systems, 2011, 6(5): 424431.
［11］刘张雷, 史忠科. 城市动态时间最短路径诱导系统实现研究［J］. 控制工程, 2010, 17(3): 351355.
 LIU Zhanglei, SHI Zhongke. Implementation of urban timedependent shortest route guidance system［J］. Control Engineering of China, 2010, 17(3): 351355.
［12］万玮，刘晔，李立宏，等. 采用联合优化方式的最佳路径算法研究［J］. 计算机工程与应用, 2007, 43(30): 97100.
WAN Wei, LIU Ye, LI Lihong, et al. Reseach on optimal path search algorithm adopting union optimization method［J］. Computer Engineering and Applications， 2007, 43(30): 97100.
［13］王亚文，汪西莉，曹菡，等. 一种动态限制搜索区域的最短路径规划算法［J］. 计算机应用研，　2007, 24(7): 8991.
WANG Yawen, WANG Xili, CAO Han, et al. Shortest routeplanning algorithm within dynamic restricted searching area［J］. Application Research of Computer, 2007, 24(7): 8991.
［14］苗洋, 陈奇. 嵌入式环境中分层路径规划算法改进［J］. 计算机工程, 2010, 36(14): 243245.
 MIAO Yang, CHEN Qi. Improvement of hierarchical path planning algorithm in embedded environment［J］. Computer Engineering, 2010, 36(14): 243245.
［15］苏海滨, 张继涛. 限制搜索区域的分层路径规划新算法［J］. 河南大学学报：自然科学版, 2008, 38(1): 8184.
SU Haibin, ZHANG Jitao. A new algorithm of hierarchical route planning with restricted search area［J］. Journal of Henan University: Natural Science, 2008, 38(1): 8184. 
Similar References:

Memo

-

Last Update: 2012-07-12

Copyright © CAAI Transactions on Intelligent Systems