重庆理工大学学报（自然科学版）2011，Vol.25Issue(4)：65-69,5.
一种基于无相交搜索策略的蚁群算法
An Ant Colony Algorithm Based No Intersection Search Strategy
摘要
Abstract
Ant colony algorithm is a simulation of foraging behavior of ants. Combined with human factors to solve complex combinatorial optimization problem of the intelligent algorithm, it could avoid premature convergence and stagnation, and it is a non-intersection algorithm (NIAS). The algorithm could determine the information of path intersection, and adjust the pheromone evaporation factor ρ,and dynamically optimize the iterative cost so as to improve the optimal solution. It could make the ability of local optimization algorithm be more rapidly, and enhance the diversity of searching optimal solution, as well as effectively control the algorithm in problem of premature convergence, therefore it strengthened the optimization performance of algorithm. By means of the example of TSPLIB, and comparing with ant system algorithm by simulation experiments, the results show that the algorithm is significantly improved.关键词
蚂蚁系统/线段相交/旅行商问题Key words
ant system/ line segments intersect/ TSP分类
信息技术与安全科学引用本文复制引用
王越,黄丽丰..一种基于无相交搜索策略的蚁群算法[J].重庆理工大学学报（自然科学版）,2011,25(4):65-69,5.基金项目
重庆市科技攻关项目(CSTC,2009AC2068) （CSTC,2009AC2068）
