A Modified Binary Particle Swarm Optimization for Knapsack Problems

DOI10.1016/j.amc.2012.05.001zbMath1284.90062OpenAlexW2094859983MaRDI QIDQ387477

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

zbMATH Keywords

knapsack problemsSigmoid functionbinary particle swarm optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (14)

A novel \(x\)-shaped binary particle swarm optimization ⋮ New upper bounds and exact methods for the knapsack sharing problem ⋮ An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems ⋮ Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application ⋮ Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm ⋮ Shrinking hypersphere based trajectory of particles in PSO ⋮ An ant colony optimization approach for binary knapsack problem under fuzziness ⋮ A diverse human learning optimization algorithm ⋮ Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem ⋮ Solving 0-1 knapsack problems based on amoeboid organism algorithm ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem ⋮ Dichotomous binary differential evolution for knapsack problems ⋮ Algorithms for randomized time-varying knapsack problems ⋮ Novel binary differential evolution algorithm for knapsack problems

Uses Software

• OR-Library

Cites Work

• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
• A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• A genetic algorithm for the multidimensional 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 review of particle swarm optimization. I: Background and development
• A new ant colony optimization algorithm for the multidimensional Knapsack problem
• The Multidimensional Knapsack Problem: Structure and Algorithms
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
• Discrete-Variable Extremum Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A Modified Binary Particle Swarm Optimization for Knapsack Problems