Gompertz PSO variants for knapsack and multi-knapsack problems

DOI10.1007/S11766-021-4583-YzbMath1499.90178OpenAlexW4200379570MaRDI QIDQ2076716

Pinkey Chauhan, Kusum Deep, Millie Pant

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

chaosknapsack problemsGompertz functionmulti-knapsack problemsbinary PSO

Mathematics Subject Classification ID

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

Uses Software

• OR-Library

Cites Work

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

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