交通运输系统工程与信息 ›› 2007, Vol. 7 ›› Issue (3): 45-48 .

• 智能交通系统与信息技术 • 上一篇    下一篇

遗传算法在动态路径诱导系统中的应用

邹亮1,徐建闽2,朱玲湘3   

  1. 1. 深圳大学 土木工程学院, 深圳 518060
    2 华南理工大学 交通学院,广州510640
    3 华南农业大学 理学院应用数学系,广州510642
  • 收稿日期:2006-12-14 修回日期:1900-01-01 出版日期:2007-06-25 发布日期:2007-06-25

Application of Genetic Algorithm in Dynamic Route Guidance System

Zou Liang1 Xu Jianmin2 Zhu Ling-xiang3   

  1. 1 College of Civil Engineering, Shenzhen University, Shenzhen 518060, China
    2 College of Traffic and Communication, South China University of Technology, Guangzhou 510640, China 3 Department of Applied Mathematics, College of Science, South China Agricultural University, Guangzhou 510642, China
  • Received:2006-12-14 Revised:1900-01-01 Online:2007-06-25 Published:2007-06-25

摘要: 提出了以随机A*算法为基础,运用遗传算法来求解不满足先进先出原则的动态网络中最短路径问题的思路,其中通过运用提出的随机Dijkstra算法解决了将遗传算法应用于最短路径问题中的最大障碍-初始种群的产生。最后,以广州市电子地图为基础,对提出的算法进行了验证,试验结果表明遗传算法适合求解非常态且不满足先进先出原则的动态网络中的路径诱导问题。

关键词: 随机A*算法, 电子地图, 动态路径诱导系统, 最短路径, 遗传算法

Abstract: By applying random A* algorithm, this paper clears out the biggest obstruction between the genetic algorithm and dynamic route guidance, which is how to get the initial generation of genetic algorithm. The developed models and algorithms are implemented with Guangzhou’s electronic map and their computational performance is analyzed experimentally. The results indicate that dynamic route guidance A* algorithm is suited for route guidance problem in FIFO dynamic network, that dynamic route guidance Q-learning algorithm is suited for route guidance problem in steady non-FIFO dynamic network and dynamic route guidance genetic algorithm is suited for route guidance problem in vertiginous non-FIFO dynamic network.

Key words: random A* algorithm, electronic maps, DRGS, shortest path, genetic algorithm

中图分类号: