In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for 2D rectangular and irregular packing has been fairly limited in terms of object size, number and dimension of items. A systematic investigation into the performance of new algorithms requires the use of a range of test problems. As it is tedious and time consuming to construct a large number of packing problems manually, problem generators have been developed allowing the creation test instances. The generators in this work address 2D guillotineable and non-guillotineable strip packing as well as 2D bin packing problems.
[1]
John E. Beasley,et al.
OR-Library: Distributing Test Problems by Electronic Mail
,
1990
.
[2]
Eva Hopper,et al.
Two-dimensional Packing utilising Evolutionary Algorithms and other Meta-Heuristic Methods
,
2002
.
[3]
Kurt Mehlhorn,et al.
LEDA: a platform for combinatorial and geometric computing
,
1997,
CACM.
[4]
E. Hopper,et al.
An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
,
2001,
Eur. J. Oper. Res..
[5]
E. Hopper,et al.
A genetic algorithm for a 2D industrial packing problem
,
1999
.