基于记忆机制的动态交通路径优化算法  

Dynamic traffic path optimization algorithm based on mnemonic mechanism

作　　者：姜桂艳[1] 郑祖舵[1] 白竹[1] 赵佳琪[1] 代磊磊[1] 

机构地区：[1]吉林大学交通学院,长春130022

出　　处：《吉林大学学报（工学版）》2007年第5期1043-1048,共6页Journal of Jilin University:Engineering and Technology Edition

基　　金：国家自然科学基金重点资助项目(50338030);国家自然科学基金资助项目(50178072)

摘　　要：在对经典路径优化算法性能进行分析的基础上,指出了现有路径优化算法在大规模路网条件下实时性差的问题.通过比较道路交通网络路径优化和机器人寻路过程的异同点,基于智能机器人寻路的D^＊ Lite算法和记忆规则,提出一种新的道路网络动态路径优化算法,并对其性能进行了测试和对比分析.结果表明,该方法在保证路径优化结果相近的情况下可以减少优化计算时间26%～50%.The analysis of the traditional traffic path optimization algorithms showed that their real-time capability appear insufficient under the large-scale road network conditions. Comparing the path optimization algorithm in the road traffic with that in seeking path for the robot, a new path optimization algorithm was proposed based on the D^＊ Lite path planning algorithm of the robot and the mnemonic mechanism. The proposed algorithm was tested and analyzed comparatively. The results show that the proposed algorithm reduces the calculation time by 26%-50% with almost the same optimized paths generated.

关 键 词：交通运输系统工程 动态路径优化 Dijkstra算法 A^＊算法 D^＊Lite算法 记忆机制 

分 类 号：U491.2[交通运输工程—交通运输规划与管理]