Gompertz PSO variants for knapsack and multi-knapsack problems

DOI10.1007/S11766-021-4583-YMaRDI QIDQ2076716zbMATH OpenOpenAlexFDO

Authors Pinkey Chauhan, Millie Pant, Kusum Deep

Publication date 22 February 2022

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-021-4583-y

zbMATH Keywords

binary PSOchaosGompertz functionknapsack problemsmulti-knapsack problems

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
• An improved binary particle swarm optimization for discrete optimization problems
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
• Essential particle swarm optimization queen with tabu search for MKP resolution

Cites work

• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem

Cited in

(1)

• A Modified Binary Particle Swarm Optimization for Knapsack Problems

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Gompertz PSO variants for knapsack and multi-knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076716)