Article:

J.O. Berkey and P.Y. Wang. Two-dimensional finite bin-packing algorithms. Journal of the Operational Research Society, 38:423-429, 1987

Instances defined:

Berkey-Wang

Instances used:

-

Results:

Berkey and Wang tested the performance of their investigated algorithms on randomly genrerated problems varying both the bin size and size of the boxes packed. The results were presented by the following table.

Average number of bins packed
1 ≤ height ≤ 10
1 ≤ height ≤ 35
1 ≤ height ≤ 100
1 ≤ width ≤ 10
1 ≤ width ≤ 35
1 ≤ width ≤ 100
Algorithm Bin size 10 × 10 Bin size 30 × 30 Bin size 40 × 40 Bin size 100 × 100 Bin size 100 × 100 Bin size 300 × 300
Finite next-fit
43
4
40
5
41
4
Finite first-fit
32
4
27
5
29
3
Finite best-strip
32
4
26
5
29
3
Finite bottom-left
36
5
29
6
32
4
Next-bottom-left
45
5
40
6
41
4
Hybrid first-fit
32
4
26
5
29
3
Lower bound for N*
28
4
23
4
24
3