A heuristic approach for packing identical rectangles in convex regions

Authors:
Andrea Cassioli;Marco Locatelli
Affiliations:
Dipartimento di Sistemi e Informatica, Universití di Firenze Via di Santa Marta, 3, 50139 Firenze, Italy;Dipartimento di Ingegneria dell'Informazione, Universití di Parma Via G.P. Usberti, 181/A, 43124 Parma, Italy
Venue:
Computers and Operations Research
Year:
2011

Citing 15
Cited 0

On the limited memory BFGS method for large scale optimization

Mathematical Programming: Series A and B
Global Optimization on Funneling Landscapes

Journal of Global Optimization
Packing equal circles in a square: a deterministic global optimization approach

Discrete Applied Mathematics
An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Computers and Operations Research
A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems

SIAM Journal on Optimization
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization

Computers and Operations Research
New Approaches to Circle Packing in a Square: With Program Codes (Springer Optimization and Its Applications)

New Approaches to Circle Packing in a Square: With Program Codes (Springer Optimization and Its Applications)
Minimizing the object dimensions in circle and sphere packing problems

Computers and Operations Research
Adaptive and restarting techniques-based algorithms for circular packing problems

Computational Optimization and Applications
Cutting circles and polygons from area-minimizing rectangles

Journal of Global Optimization
New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

Computers and Operations Research
Solving the problem of packing equal and unequal circles in a circular container

Journal of Global Optimization
Orthogonal packing of identical rectangles within isotropic convex regions

Computers and Industrial Engineering
Efficiently packing unequal disks in a circle

Operations Research Letters
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

Discrete Optimization

Quantified Score

Hi-index	0.01

Visualization

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.