首页 | 本学科首页   官方微博 | 高级检索  
     

改进蚁群算法求解两地间时间最优路径
引用本文:赵海发,翟文胜.改进蚁群算法求解两地间时间最优路径[J].电脑编程技巧与维护,2011(22):51-53.
作者姓名:赵海发  翟文胜
作者单位:郑州交通职业学院,郑州,450062
摘    要:为提高蚁群算法的运算效率,提出一种改进的蚁群算法来求解问题。研究中中引入阀值排序算法对搜索路径进行优化,解决了蚁群算法前期搜索路径的盲目性问题。改进的蚁群算法加快了收敛速度,并提高了稳定性。经仿真试验证明,改进蚁群算法性在减少算法的迭代次数和提高解的稳定性方面有了较大的提高,并且能很好的用于求解路径时间最优问题。

关 键 词:蚁群算法  时间最优  期望因子  阀值排序算法

Solving the Time Optimal Path between the Two Locations by Improved Ant Colony Algorithm
ZHAO Haifa,ZHAI Wensheng.Solving the Time Optimal Path between the Two Locations by Improved Ant Colony Algorithm[J].Computer Programming Skills & Maintenance,2011(22):51-53.
Authors:ZHAO Haifa  ZHAI Wensheng
Affiliation:ZHAO Haifa,ZHAI Wensheng(Zhengzhou Jiaotong University,Zhengzhou 450062)
Abstract:Optimization problem of the time optimal path between the two locations is studied.For the basic ant colony algorithm search blind,iterate time long and trap a local optimal solution easily,an improved intelligent ant colony algorithm is proposed to improve the problems and increase its operational efficiency.In the program,threshold sort algorithm is introduced to optimal search path,the problem of slow convergence is solved which is caused by blindness of ant colony algorithm convergence in the early.Impr...
Keywords:Ant colony algorithm  Time optimal  Expected factor  Threshold sorting algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号