Quantum-inspired wolf pack algorithm to solve the 0-1 knapsack problem

DOI10.1155/2018/5327056MaRDI QIDQ1721079zbMATH OpenOpenAlexWikidataFDO

Authors Xianqiang Yang

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2018/5327056

Mathematics Subject Classification ID

Quantum computation (81P68) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: 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.

Recommendations

• A binary wolf pack algorithm for solving 0-1 knapsack problems
• Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
• A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem
• A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
• A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem

Cites work

• A binary wolf pack algorithm for solving 0-1 knapsack problems
• A new swarm intelligence algorithm -- wolf pack algorithm
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Ant colony optimization.
• Evolutionary algorithms for knapsack problems
• scientific article; zbMATH DE number 3996829 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Wolf pack algorithm for unconstrained global optimization

Cited in

(11)

• A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem
• A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
• Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
• A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
• An improved binary wolf pack algorithm for solving multidimensional knapsack problems
• A quantum-inspired evolutionary algorithm based on P systems for knapsack problem
• An adaptive population multi-objective quantum-inspired evolutionary algorithm for multi-objective 0/1 knapsack problems
• Algorithms and Computation
• Improved quantum particle swarm optimization algorithm for multi-dimensional multi-choice knapsack problem
• A binary wolf pack algorithm for solving 0-1 knapsack problems
• An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems

Describes a project that uses

Uses Software

• ABC

This page was built for publication: Quantum-inspired wolf pack algorithm to solve the 0-1 knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1721079)