A novel \(x\)-shaped binary particle swarm optimization
From MaRDI portal
Publication:2157062
DOI10.1007/s00500-020-05360-2zbMath1491.90185OpenAlexW3093197087MaRDI QIDQ2157062
Publication date: 21 July 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-020-05360-2
Related Items (2)
An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems ⋮ A distribution center location optimization model based on minimizing operating costs under uncertain demand with logistics node capacity scalability
Cites Work
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
- BGSA: Binary gravitational search algorithm
- A hybrid PSO-GA algorithm for constrained optimization problems
- An expanded particle swarm optimization based on multi-exemplar and forgetting ability
- A parameter-free particle swarm optimization algorithm using performance classifiers
This page was built for publication: A novel \(x\)-shaped binary particle swarm optimization