摘要
文中算法将蚁群算法与混沌搜索相结合,蚁群算法陷入局部最优时,利用混沌搜索对局部最优解进行二次寻优;对二次寻优结果再重复利用蚁群算法,扩大了搜索范围,避免了算法易陷入局部最优的特点。最后通过三个TSP问题进行实验对比,结果表明基于混沌搜索的蚁群算法充分利用了混沌搜索的随机性和蚁群算法的并行性,在收敛性和优化性方面得到了提高。
The ant colony algorithm is combined with the chaotic search in the paper. The chaos search is used to get quadratic optimization based on the local optimization of ant colony algorithm. The ant colony algorithm is used on the quadratic optimization again. This avoids falling into local optimization algorithm and expands search. Finally, three TSP problems are compared through the experimental..The ant colony algorithm based on the chaos search takes full use of the randomness of chaotic search and the parallel of ant colony algorithm. It has improved the convergence and optimization by the experiment.
出处
《信息技术》
2012年第11期76-77,80,共3页
Information Technology
关键词
蚁群算法
混沌搜索
局部最优
ant colony algorithm
the chaos search
local optimization
