动态蚁群算法用于洪灾搜救问题  

Application of dynamic ant colony algorithm in flood rescue

作　　者：张聪[1] 曲卫平[1] 

机构地区：[1]安徽理工大学计算机科学与工程学院,安徽淮南232001

出　　处：《现代电子技术》2013年第23期113-114,117,共3页Modern Electronics Technique

摘　　要：蚁群算法是一种求解最优路径的常用算法,其利用自然界中蚁群的活动规律和正反馈原理。动态的蚁群算法针对基本蚁群算法存在的问题和缺点进行改进,采用动态参数因子,可以有效避免搜索的局部最优和进化停滞现象,并且能够提高搜索效率。通过实验结果对比,该算法在求解最短路径方面具有更高的精确度,为今后的搜救问题提供了一种高效实用的参考方法。Ant colony algorithm, using the positive feedback principle and the activity rhythm of ant colony in nature, is one of commonly used algorithms for finding the optimal path. Dynamic ant colony algorithm has improved the problems and dis- advantages existing in basic ant colony algorithm, the local optimal search and evolutionary stagnation phenomenon can be effec- tively avoided by using dynamic parameter factors, and the search efficiency can be improved. By comparison with the experi- mental results, the algorithm has higher accuracy in finding the shortest path, which provides an efficient and practical reference method for the future search problems.

关 键 词：洪灾搜救 蚁群算法 动态参数因子 信息素 

分 类 号：TN911.34[电子电信—通信与信息系统] TP18[电子电信—信息与通信工程]