| 时变路网双目标动态路线优选有约束A*算法 |
| |
| 引用本文： | 王东柱,陈艳艳,朱书善.时变路网双目标动态路线优选有约束A*算法[J].长安大学学报(自然科学版),2011(1):79-83. |
| |
| 作者姓名： | 王东柱 陈艳艳 朱书善 |
| |
| 作者单位： | 交通运输部公路科学研究院国家智能交通系统工程技术研究中心;北京工业大学北京市交通工程重点实验室; |
| |
| 基金项目： | 国家“十一五”科技支撑计划项目(2006BAJ18B01-06) |
| |
| 摘 要： | 为了解决现有交通时变网络(网络中的路权为时间的函数)模型中计算所得的最短路不稳定的问题,构建符合首进首出原则的时变网络,进而将时变网络扩展为一系列静态网络,并在扩展的静态路网上应用A*算法求解时变最短路;同时,为满足用户多重喜好,借助道路延误风险分析,设计有约束的时变A*算法,在路径寻优过程中对高延误风险路段进行启发式规避,从而实现在绕行许可范围内有效减少延误风险的可靠路径的快速搜索。数值试验结果表明:本算法由于利用了离线计算的信息,大大增加了有约束的动态A*算法的效率;考虑了阻塞发生的可能性,提高了导航的准确性,减少了出行延误风险;该方法具有路径搜索速度快、可有效避开延误高风险路段的优点。
|
| 关 键 词： | 交通工程 动态A*算法 时变网络 延误风险 可靠路径搜索 |
Time-dependent route optimization with double objective by a constrained dynamic A* algorithm |
| |
| WANG Dong-zhu,CHEN Yan-yan,ZHU Shu-shan.Time-dependent route optimization with double objective by a constrained dynamic A* algorithm[J].JOurnal of Chang’an University:Natural Science Edition,2011(1):79-83. |
| |
| Authors: | WANG Dong-zhu CHEN Yan-yan ZHU Shu-shan |
| |
| Institution: | WANG Dong-zhu1,CHEN Yan-yan2,ZHU Shu-shan1(1.National Engineering and Technology Center of Intelligent Transport System,Research Institute of Highway Ministry Transport,Beijing 100088,China,2.Beijing Key Laboratory of Traffic Engineering,Beijing University of Technology,Beijing 100124,China) |
| |
| Abstract: | To solve the problem that the calculated shortest path are unstable in time dependent transport network,a time-dependent road network that following first in-first out principle is built,and it is divided into a series of static network.Based on the static network,the shortest route of time-dependent is deduced by A* algorithm.To meet the users' multi route choice favours,depending on delay risk analysis,a constrained dynamic A* algorithm is proposed by avoiding high-risk links heuristically to search for a... |
| |
| Keywords: | traffic engineering dynamic A* algorithm time-dependent road network delay risk reliable path search |
| 本文献已被 CNKI 等数据库收录！ |
|
