...
首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >Quantum-Inspired Wolf Pack Algorithm to Solve the 0-1 Knapsack Problem
【24h】

Quantum-Inspired Wolf Pack Algorithm to Solve the 0-1 Knapsack Problem

机译:量子启发式Wolf Pack算法解决0-1背包问题

获取原文

摘要

This paper proposes a Quantum-Inspired wolf pack algorithm (QWPA) based on quantum encoding to enhance the performance of the wolf pack algorithm (WPA) to solve the 0-1 knapsack problems. There are two important operations in QWPA quantum rotation and quantum collapse. The first step enables the population to move to the global optima and the second step helps to avoid the trapping of individuals into local optima. Ten classical and four high-dimensional knapsack problems are employed to test the proposed algorithm, and the results are compared with other typical algorithms. The statistical results demonstrate the effectiveness and global search capability for knapsack problems, especially for high-level cases.
机译:本文提出了一种基于量子编码的量子启发式狼群算法(QWPA),以提高狼群算法(WPA)的性能,以解决0-1背包问题。 QWPA量子旋转和量子崩溃有两个重要的操作。第一步使总体趋于全局最优,第二步帮助避免个体陷入局部最优。用十个经典的和四个高维背包问题来测试该算法,并将结果与​​其他典型算法进行比较。统计结果证明了背包问题的有效性和全局搜索能力,特别是对于高级案例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号