An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems

DOI10.1016/j.ins.2023.119529MaRDI QIDQ6052645

Xiaotong Li, Shuwei Zhu, Wei Fang

Publication date: 22 September 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2023.119529

zbMATH Keywords

transfer function; knapsack problem; combinatorial optimization problem; quantum-behaved particle swarm optimization; local attractor

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• Cancer feature selection and classification using a binary quantum-behaved particle swarm optimization and support vector machine
• Dynamic programming algorithms for the zero-one knapsack problem
• On the computational complexity of reliability redundancy allocation in a series system
• Where are the hard knapsack problems?
• Novel binary differential evolution algorithm for knapsack problems
• A novel \(x\)-shaped binary particle swarm optimization
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem