|
|
|
Chair of Business Administration and Decision Analysis
Friedrich-Schiller-University Jena | Chair of Operations Research
Darmstadt University of Technology |
Data set 3 for BPP-1
The data can be downloaded by clicking here.
The data files have extensions ".bpp".
Notation
| parameter | meaning |
|---|
| n | number of items |
| wj | weight (size) of item j (j=1,...,n) |
| c | bin capacity |
| m* | minimal number of bins |
Parameter setting
| parameter | values |
|---|
| n | 200 |
| c | 100000 |
| wj | from [20000,35000] for j=1,...,n |
This setting of the parameters guarantees that the weights are widely spread.
Furthermore, the number of items per bin lies between 3 and 5. Data set 3 contains
10 instances. |
Name conventions:
| The instances are given the names HARDv.BPP with v=0..9. |
Instances and minimal number of bins
| Name | m* | Name | m* | Name | m* |
|---|
| HARD1 | 57
| HARD2 | 56
| HARD3 | 55 |
|---|
| HARD4 | 57
| HARD5 | 56
| HARD6 | 57 |
|---|
| HARD7 | 55
| HARD8 | 57
| HARD9 | 56 |
|---|
| HARD0 | 56 |
|---|
Acknowledgment
Originally, 7 instances remained open, i.e., the optimal solutions were not known. In the meantime these instances have been solved by Schwerin and Wäscher as documented in:
Schwerin, P. and G. Wäscher: The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP. International Transactions in Operational Research 4 (1997), pp. 377-389. |
Last updated: 09/01/03 by Armin Scholl
|
