Optimization Online


A heuristic approach for packing rectangles in convex regions.

Andrea Cassioli(cassioli***at***dsi.unifi.it)
Marco Locatelli(locatell***at***ce.unipr.it)

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 (or, using a terminology employed for continuous problems, a Monotonic Basin Hopping), 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

Category 1: Applications -- OR and Management Sciences

Category 2: Global Optimization

Category 3: Nonlinear Optimization


Download: [PDF]

Entry Submitted: 06/01/2010
Entry Accepted: 06/01/2010
Entry Last Modified: 06/01/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society