Improved quantum particle swarm optimization algorithm for multi-dimensional multi-choice knapsack problem

DOI10.13413/J.CNKI.JDXBLXB.2018.06.29MaRDI QIDQ5194360zbMATH OpenFDO

Authors Xue Yang, Yuxin Dong, Hong-Bin Dong

Publication date 20 September 2019

Full work available at URL https://doi.org/10.13413/J.CNKI.JDXBLXB.2018.06.29

zbMATH Keywords

local disturbancemulti-dimensional multi-choice knapsack problemquantum particle swarm optimization algorithm

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Quantum-inspired wolf pack algorithm to solve the 0-1 knapsack problem
• A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• scientific article; zbMATH DE number 5733644

Cited in

(1)

• A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem

This page was built for publication: Improved quantum particle swarm optimization algorithm for multi-dimensional multi-choice knapsack problem

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