Research Article
A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems
Table 3
The parameters of the high-dimensional 0-1 knapsack problems.
| | No. | Dim. | Capacity | maxFEs |
| | Kp13 | 200 | 1500 | 15 000 | | Kp14 | 300 | 1700 | 20 000 | | Kp15 | 500 | 2000 | 20 000 | | Kp16 | 800 | 5000 | 30 000 | | Kp17 | 1000 | 10000 | 30 000 | | Kp18 | 1200 | 14000 | 40 000 | | Kp19 | 1500 | 16000 | 40 000 | | Kp20 | 2000 | 22000 | 50 000 |
|
|
