A Modified Binary Particle Swarm Optimization for Knapsack Problems
From MaRDI portal
Publication:387477
DOI10.1016/J.AMC.2012.05.001zbMATH Open1284.90062OpenAlexW2094859983MaRDI QIDQ387477FDOQ387477
Jagdish Chand Bansal, Kusum Deep
Publication date: 23 December 2013
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.05.001
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- The multidimensional knapsack problem: structure and algorithms
- A genetic algorithm for the multidimensional knapsack problem
- Discrete-Variable Extremum Problems
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A review of particle swarm optimization. I: Background and development
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- Local search with memory: Benchmarking RTS
- Dynamic tabu list management using the reverse elimination method
- A hybrid genetic algorithm for the multidimensional knapsack problem
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- Title not available (Why is that?)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
Cited In (15)
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- Algorithms for randomized time-varying knapsack problems
- Shrinking hypersphere based trajectory of particles in PSO
- Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application
- A novel \(x\)-shaped binary particle swarm optimization
- Intelligent water drops algorithm
- Dichotomous binary differential evolution for knapsack problems
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- Novel binary differential evolution algorithm for knapsack problems
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- A diverse human learning optimization algorithm
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
- An ant colony optimization approach for binary knapsack problem under fuzziness
- New upper bounds and exact methods for the knapsack sharing problem
Uses Software
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)
