A quantum artificial bee colony algorithm based on quantum walk for the 0–1 knapsack problem

Author:

Huang Yuwei,Zhou TianaiORCID,Xu GangORCID,Wang Lefeng,Lu Yong,Ma Li,Zhang Kejia,Chen Xiu-bo

Abstract

Abstract Based on the characteristics of the quantum mechanism, a novel quantum walk artificial bee colony algorithm is proposed to promote performance. Firstly, the discrete quantum walk is an approach taken to search for new food sources in the updated phase for employed bees and onlooker bees, which can enhance the probability of the target solution to extend the exploration capability. Secondly, the food source selection policy of the onlooker bees changes, from roulette selection to tournament selection, to boost exploitation and convergence speed. Finally, the novel algorithm is brought forward, along with the approach to analyze 0–1 knapsack problems. The experimental results prove that our algorithm can overcome the premature phenomenon and perform better in the areas of search capability, convergence speed, and stability performance. The performance is superior to that of the conventional artificial bee colony algorithm, as well as the genetic algorithm, in a set of 0–1 knapsack problems.

Funder

Fundamental Research Funds for Heilongjiang University

Double First-Class Project for Collaborative Innovation Achievements in Disciplines Construction

State Key Laboratory of Public Big Data

NSFC

Publisher

IOP Publishing

Reference39 articles.

1. A new quantum-inspired genetic algorithm for solving the travelling salesman problem;Talbi;IEEE Trans. Evol. Comput,2004

2. Quantum-inspired estimation of distribution algorithm to solve the travelling salesman problem;Soloviev,2021

3. A modified artificial bee colony approach for the 0-1 knapsack problem;Cao;Appl. Intell.,2018

4. A discrete improved artificial bee colony algorithm for 0–1 knapsack problem;Zhang;IEEE Access,2019

5. MTPSO algorithm for solving planar graph coloring problem;Hsu;Expert Syst. Appl.,2011

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3