Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms

DOI10.1080/03155986.1994.11732253zbMath0823.90092OpenAlexW7875117MaRDI QIDQ4834075

Jochen Thiel, Stefan Voß

Publication date: 25 October 1995

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1994.11732253

zbMATH Keywords

genetic algorithmsNP-hardheuristicmulticonstraint zero-one knapsack problemlocal search improvement

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (11)

An improved typology of cutting and packing problems ⋮ Metaheuristics: A bibliography ⋮ A Modified Binary Particle Swarm Optimization for Knapsack Problems ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ An efficient algorithm to allocate shelf space ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

This page was built for publication: Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms