首页> 外文会议>IEEE Joint International Information Technology and Artificial Intelligence Conference >An improved hybrid ant colony algorithm and its application in solving TSP
【24h】

An improved hybrid ant colony algorithm and its application in solving TSP

机译:一种改进的混合蚁群算法及其在解决TSP中的应用

获取原文

摘要

Ant colony algorithm is a simulated evolutionary algorithm with the characteristics of positive feedback and distributed computation. It simulate the process of ants foraging to search the optimal solution. But the algorithm fall into local optimum easily and the convergence speed is very slow. After analyzing the disadvantages of ant colony algorithm, we put forward an improved hybrid ant colony algorithm. For each generation of ant colony perform crossover and mutation operations, and accept new individuals with a specified probability according to the Metropolis criterion of simulation annealing algorithm. Through series of simulation experiments' results, it can be found that the proposed algorithm is good at stability and optimization capacity.
机译:蚁群算法是一种模拟进化算法,具有积极反馈和分布式计算的特征。 它模拟蚂蚁觅食的过程来搜索最佳解决方案。 但该算法容易进入局部最佳,收敛速度非常慢。 在分析蚁群算法的缺点后,我们提出了一种改进的混合蚁群算法。 对于每代蚁群进行交叉和突变操作,并根据仿真退火算法的大都会标准接受具有指定概率的新个人。 通过仿真实验的结果,可以发现所提出的算法擅长稳定性和优化能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号