A Modified Binary Particle Swarm Optimization for Knapsack Problems
From MaRDI portal
(Redirected from Publication:387477)
Recommendations
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- Gompertz PSO variants for knapsack and multi-knapsack problems
- A binary modified harmony search algorithm for 0-1 knapsack problems
- Study of an improved hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- A binary wolf pack algorithm for solving 0-1 knapsack problems
Cites work
- scientific article; zbMATH DE number 1054947 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A genetic algorithm for the multidimensional knapsack problem
- A hybrid genetic algorithm for the multidimensional knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A review of particle swarm optimization. I: Background and development
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Discrete-variable extremum problems
- Dynamic tabu list management using the reverse elimination method
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Local search with memory: Benchmarking RTS
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- The multidimensional knapsack problem: structure and algorithms
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
Cited in
(30)- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- On solving the double loading problem using a modified particle swarm optimization
- A binary modified harmony search algorithm for 0-1 knapsack problems
- Study of an improved hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- An improved binary wolf pack algorithm for solving multidimensional knapsack problems
- Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem
- Shrinking hypersphere based trajectory of particles in PSO
- An ant colony optimization approach for binary knapsack problem under fuzziness
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- Novel binary differential evolution algorithm for knapsack problems
- A kind of hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- A small world algorithm for multi-dimensional knapsack problems
- Gompertz PSO variants for knapsack and multi-knapsack problems
- New upper bounds and exact methods for the knapsack sharing problem
- Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application
- A novel \(x\)-shaped binary particle swarm optimization
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- A binary wolf pack algorithm for solving 0-1 knapsack problems
- Improved quantum particle swarm optimization algorithm for multi-dimensional multi-choice knapsack problem
- A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
- Intelligent water drops algorithm
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- A diverse human learning optimization algorithm
- Algorithms for randomized time-varying knapsack problems
- Dichotomous binary differential evolution for knapsack problems
- Essential particle swarm optimization queen with tabu search for MKP resolution
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
This page was built for publication: A Modified Binary Particle Swarm Optimization for Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387477)
