基于改进蚁群算法的最优路径搜索方法研究  

Study of optimal-routing choice of travelling based on improved ant algorithm

作　　者：林涛[1] 陈克斌[1] 

机构地区：[1]陇东学院电气工程学院,甘肃庆阳745000

出　　处：《传感器世界》2012年第10期15-18,共4页Sensor World

基　　金：陇东学院青年科技创新项目;项目编号:XYZK1009

摘　　要：基本蚁群算法在求解图的最优路径问题时,随着图的节点的增加,搜索速度变慢,并且容易陷入局部最优的问题。针对这个问题,对基本蚁群算法进行改进,通过引入搜索方向引导信息和搜索热区信息提高了算法的搜索速度和精度。仿真实验表明,改进蚁群算法比基本蚁群算法具有更高搜索速度和精度,且易得到全局最优路径.When optimal routing is resolved with original ant colony algorithms, the search speeds are getting slower and slower and it is easy to cause the problem of local optimization as the nodes are added.To deal with this problem ,an improved ant colony algorithm is proposed ,which increases the search speed and accuracy by introducing search direction guidance information and search hot section information. Simulated experiments show that the improved ant colony algorithm has higher speed and accuracy and is easier to get global optimal routing than the traditional ones

关 键 词：蚁群算法 最优路径 信息素 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]