基于蚁群算法的最优路径选择问题的研究  

Research for optimal routing problem based on ant colony algorithm

作　　者：夏立民[1] 王华[1] 窦倩[1] 陈玲[1] 

机构地区：[1]首都师范大学信息工程学院,北京100037

出　　处：《计算机工程与设计》2007年第16期3957-3959,4058,共4页Computer Engineering and Design

基　　金：北京市教委基金项目(KM200410028013)

摘　　要：交通网络中最优路径的选择尤为重要,各国学者在这方面做了大量的研究和改进。提出了一种基于蚁群算法的最优路径选择问题的新方法。在最优路径的选择过程中采用蚁群算法并对其进行建模,能够发挥算法并行性、正反馈、协作性等特点,使各蚂蚁个体之间相互协作,在较短的时间内发现较优解。研究及模拟实验结果表明,蚁群算法是一种鲁棒性较强的新型模拟仿生算法,具有较好的发展前景。It＇s necessary to choose the optimal route in traffic network. Various foreign researchers have done a lot of research and im- provement. A new method about choosing the optimal routing problem based on ant colony algorithm is presented. In the process of choosing the best path, ACA is used and built a mathematic model for this. In this model, the ACA＇s characters such as parallelism, positive feedback and collaboration are exerted, with which the unit could collaborate each other and could find the better solution in shorter time. The study and simulation results indicate that ACA is a new simulated bionic algorithm with robust, and it has a better progress foreground.

关 键 词：蚁群算法 交通网络 最优路径 信息素 模拟进化算法 

分 类 号：TP182[自动化与计算机技术—控制理论与控制工程]