A heuristic approach for packing identical rectangles in convex regions |
| |
| Authors: | Andrea Cassioli Marco Locatelli |
| |
| Affiliation: | 1. Dipartimento di Sistemi e Informatica, Università di Firenze Via di Santa Marta, 3, 50139 Firenze, Italy;2. Dipartimento di Ingegneria dell’Informazione, Università di Parma Via G.P. Usberti, 181/A, 43124 Parma, Italy |
| |
| 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. |
| |
| Keywords: | Packing problems Mixed integer global optimization Iterated local search Monotonic basin hopping |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
