Instance
Area minimization problem
We are given a set of rectangles where each rectangle has a width and height.
The rotations of 90 degree are allowed and the objective is to minimize
the area of the rectangle bin that contains all given rectangles.
We have six instances of the area minimization problem:
ami33, ami49, rp100, pcb146, rp200, pcb500.
Since the optimal solutions of these instances are unknown, we use
the sum of areas of rectangles as a lower bound of the objective function.
six instances(area.tar.gz)
Strip packing problem
These are the instances from "An empirical investigation of meta-heuristic and
heuristic algorithms for 2D packing problem", E. Hopper and B.C.H Turton,
Europian Journal of Operational Research 128 (2001) 34-57.
21 instances(strip.tar.gz)
Scheduling problem of large building blocks
This is a problem encountered in a factory producing large building blocks.
The blocks produced are very large, and each block stays in the same position
until all the processes on it are finished.
Each building block has a length, a processing time, a ready time and
a due date. As the shape of the work space is long and narrow,
the building blocks can be regarded as one dimensional objects,
which must be placed without overlap.
A block must arrive at the scheduled position after ready time, and
requires processing time, before being removed prior to due date.
A schedule is determined by the position, arrival time and removal time
of each block.
We have five instances of the scheduling problem of large building blocks:
sp50-a, sp50-b, sp78, sp100-a, sp100-b.
five instances(large.tar.gz)
Two dimensional cutting stock problem