Article:

B.E. Bengtsson. Packing rectangular pieces--A heuristic approach. The Computer Journal, 25:353-357, 1982

Instances defined:

BENG1-BENG10

Instances used:

-

Results:

Bengtsson defined 10 two-dimensional bin-packing problems.
A time limit was introduced: if for the current containerno improved solution is found within the specified time, this container is abandoned for the present and marked as inactive.The experiments were carried out with two different time limits, 0.5s( -> Value1) and 1.0s ( ->Value2).

Problem Container Size # Boxes Area of Boxes Value1 CPU Time Value2 CPU Time
BENG1
3 x ( 25, 10)
20
741
686
1.1 s
686
1.1 s
BENG2
5 x ( 25, 10)
40
1420
1216
6.4 s
1216
11.3 s
BENG3
8 x ( 25, 10)
60
2090
1930
6.3 s
1967
25.1 s
BENG4
10 x ( 25, 10)
80
2673
2474
16.6 s
2493
30.7 s
BENG5
13 x ( 25, 10)
100
3330
3221
24.0 s
3218
23.8 s
BENG6
1 x ( 40, 25)
40
1420
879
0.9 s
879
1.4 s
BENG7
2 x ( 40, 25)
80
1673
1931
5.4 s
1915
8.3 s
BENG8
4 x ( 40, 25)
120
4027
3869
14.1s
3887
15.9 s
BENG9
5 x ( 40, 25)
160
5008
4876
20.1s
4900
67.5 s
BENG10
6 x ( 40, 25)
200
6217
5928
49.6s
5903
39.5 s