New greedy heuristics for the multiple-choice multi-dimensional knapsack problem (Q2474698): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126239877 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1504/ijor.2007.014176 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037230748 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New greedy heuristics for the multiple-choice multi-dimensional knapsack problem |
scientific article |
Statements
New greedy heuristics for the multiple-choice multi-dimensional knapsack problem (English)
0 references
6 March 2008
0 references
Summary: This paper examines the Multiple-choice Multi-dimensional Knapsack Problem (MMKP) -- a more complex variant of the classic Knapsack Problem (KP). We survey existing algorithms for the variants of the KP and critically examine existing test problems for the MMKP. We present an empirical study of sample legacy solution approaches compared to two new systematically-developed greedy heuristics for the MMKP. We extend our testing to include a new systematically-generated test problem set. Characteristics of all the problem sets are compared and used to explain the empirical performance results obtained and demonstrate the superiority of our greedy heuristic approach.
0 references
optimisation
0 references
heuristics
0 references
greedy
0 references
knapsack
0 references
empirical testing
0 references
