An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
From MaRDI portal
Publication:6052645
DOI10.1016/j.ins.2023.119529OpenAlexW4385988464MaRDI 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
transfer functionknapsack problemcombinatorial optimization problemquantum-behaved particle swarm optimizationlocal attractor
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
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