【24h】

Parallel Quantum Ant Colony Optimization Algorithm

机译:并行量子蚁群优化算法

获取原文

摘要

The concept of the ant colony optimization technique for finding approximate solutions to traveling salesman problem is described. A novel Parallel Quantum Ant Colony Optimization Algorithm (QPACO) is proposed. The use of improved 3-opt mechanism and adaptive quantum interaction provides this methodology with superior local search ability; several antibody diversification schemes were incorporated into the QPACO in order to improve the balance between exploitation and exploration. Parallel implementations aim to provide further diversity by using multi-populations and inter-population migration strategies. It can maintain quite nicely the population diversity and help to obtain the optimal solutions rapidly. We describe the quantum parallel mechanism and analysis the technology of improving performance,the efficiency of the approach has been illustrated by applying to TSP benchmark instances Chn144.
机译:描述了用于寻找旅行推销员问题的近似解决方案的蚁群优化技术的概念。提出了一种新颖的并行量子蚁群优化算法(QPACO)。利用改进的3-opt机制和自适应量子交互提供了具有优越的本地搜索能力的方法;将几种抗体多样化方案纳入QPACO,以改善剥削和勘探之间的平衡。并行实施旨在通过使用多人和群体间移民策略来提供进一步的多样性。它可以保持良好的人口多样性,并有助于快速获得最佳解决方案。我们描述了量子并行机制和分析了提高性能的技术,通过应用于TSP基准实例CHN144来说明方法的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号