Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475967 | Computers & Operations Research | 2011 | 9 Pages |
Abstract
In this paper we propose a heuristic approach for the problem of packing equal rectangles within a convex region. The approach is based on an Iterated Local Search scheme, in which the key step is the perturbation move. Different perturbation moves, both combinatorial and continuous ones, are proposed and compared through extensive computational experiments on a set of test instances. The overall results are quite encouraging.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Andrea Cassioli, Marco Locatelli,