A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 4041183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simulated annealing approach to the multiconstraint zero-one knapsack problem |
scientific article; zbMATH DE number 4041183 |
Statements
A simulated annealing approach to the multiconstraint zero-one knapsack problem (English)
0 references
1988
0 references
The multiconstraint 0-1 knapsack problem encounters when deciding how to use a knapsack with multiple resource constraints. The problem is known to be NP-hard, thus a ``good'' algorithm for its optimal solution is very unlikely to exist. We show how the concept of simulated annealing may be used for solving this problem approximately. 57 data sets from literature demonstrate, that the algorithm converges very rapidly towards the optimum solution.
0 references
binary knapsack problem
0 references
multiple constraints
0 references
simulated annealing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8722349405288696
0 references
0.8356475234031677
0 references
0.8326061367988586
0 references
0.8286955952644348
0 references
