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

DOI10.1080/03155986.1994.11732253MaRDI QIDQ4834075zbMATH OpenOpenAlexFDO

Authors 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 algorithmsheuristiclocal search improvementmulticonstraint zero-one knapsack problemNP-hard

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• A genetic algorithm for the multidimensional knapsack problem
• scientific article; zbMATH DE number 1114464
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality

Cited in

(20)

• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• Metaheuristics: A bibliography
• A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
• An improved typology of cutting and packing problems
• scientific article; zbMATH DE number 1703849 (Why is no real title available?)
• scientific article; zbMATH DE number 1703850 (Why is no real title available?)
• A multiple bits greedy mutation-based genetic algorithm for knapsack problem
• Optimization of Performance of Genetic Algorithm for 0-1 Knapsack Problems Using Taguchi Method
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• scientific article; zbMATH DE number 1114464 (Why is no real title available?)
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
• scientific article; zbMATH DE number 2013563 (Why is no real title available?)
• scientific article; zbMATH DE number 1784908 (Why is no real title available?)
• 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
• 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

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