Article:

E. Hopper and B.C.H. Turton. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research, 128:34-57, 2001

Instances defined:

HT1-HT21

Instances used:

-

Results:

Hopper and Turton introduced 7 different sized strip-packing tasks ranging from 17 to 197 items. For each category there are 3 intances.

Category Problem Container Size # Boxes Optimal height
C1 HT1
( 20, 20)
16
20
HT2
( 20, 20)
17
20
HT3
( 20, 20)
16
20
C2 HT4
( 40, 15)
25
15
HT5
( 40, 15)
25
15
HT6
( 40, 15)
25
15
C3 HT7
( 60, 30)
28
30
HT8
( 60, 30)
29
30
HT9
( 60, 30)
28
30
C4 HT10
( 60, 60)
49
60
HT11
( 60, 60)
49
60
HT12
( 60, 60)
49
60
C5 HT13
( 60, 90)
73
90
HT14
( 60, 90)
73
90
HT15
( 60, 90)
73
90
C6 HT16
( 80, 120)
97
120
HT17
( 80, 120)
97
120
HT18
( 80, 120)
97
120
C7 HT19
( 160, 240)
196
240
HT20
( 160, 240)
197
240
HT21
( 160, 240)
196
240