A novel quantum swarm evolutionary algorithm for solving 0-1 knapsack problem

  • Authors:
  • Yan Wang;Xiao-Yue Feng;Yan-Xin Huang;Wen-Gang Zhou;Yan-Chun Liang;Chun-Guang Zhou

  • Affiliations:
  • College of Computer Science and Technology, Jilin University, Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry, Changchun, China;College of Computer Science and Technology, Jilin University, Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry, Changchun, China;College of Computer Science and Technology, Jilin University, Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry, Changchun, China;College of Computer Science and Technology, Jilin University, Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry, Changchun, China;College of Computer Science and Technology, Jilin University, Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry, Changchun, China;College of Computer Science and Technology, Jilin University, Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry, Changchun, China

  • Venue:
  • ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A novel quantum swarm evolutionary algorithm is presented based on quantum-inspired evolutionary algorithm in this article. The proposed algorithm adopts quantum angle to express Q-bit and improved particle swarm optimization to update automatically. The simulated effectiveness is examined in solving 0-1 knapsack problem.