Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 548957, 10 pages
Research Article

Dealing with Nonregular Shapes Packing

Graduate Program in Applied Informatics, University of Fortaleza (UNIFOR), Avenue Washington Soares 1321, Bl J Sl 30, 60811-905 Fortaleza, CE, Brazil

Received 11 April 2014; Accepted 7 June 2014; Published 8 July 2014

Academic Editor: Jer-Guang Hsieh

Copyright © 2014 Bonfim Amaro Júnior et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper addresses the irregular strip packing problem, a particular two-dimensional cutting and packing problem in which convex/nonconvex shapes (polygons) have to be packed onto a single rectangular object. We propose an approach that prescribes the integration of a metaheuristic engine (i.e., genetic algorithm) and a placement rule (i.e., greedy bottom-left). Moreover, a shrinking algorithm is encapsulated into the metaheuristic engine to improve good quality solutions. To accomplish this task, we propose a no-fit polygon based heuristic that shifts polygons closer to each other. Computational experiments performed on standard benchmark problems, as well as practical case studies developed in the ambit of a large textile industry, are also reported and discussed here in order to testify the potentialities of proposed approach.