Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949856 | Discrete Applied Mathematics | 2017 | 8 Pages |
Abstract
We consider the variant of the Two-Dimensional Bin Packing Problem in which items have to be obtained by a series of guillotine cuts and cannot be rotated. We present a heuristic algorithm based on partial enumeration, and computationally evaluate its performance on a large set of instances from the literature. Computational experiments show that the algorithm is able to produce proven optimal solutions for a large number of problems, and gives a tight approximation of the optimum in the remaining cases.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Andrea Lodi, Michele Monaci, Enrico Pietrobuoni,