Solving the two-dimensional irregular objects allocation problems by using a two-stage packing approach

Packing problems are combinatorial optimization problems that concern the allocation of multiple objects in a large containment region without overlap and exist almost everywhere in real world. Irregular objects packing problems are more complex than regular ones. In this study, a methodology that h...

Full description

Saved in:
Bibliographic Details
Published in:Expert systems with applications 2009-03, Vol.36 (2), p.3489-3496
Main Authors: Wong, W.K., Wang, X.X., Mok, P.Y., Leung, S.Y.S., Kwong, C.K.
Format: Article
Language:English
Subjects:
Genetic algorithms
Grid approximation
Irregular objects packing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Packing problems are combinatorial optimization problems that concern the allocation of multiple objects in a large containment region without overlap and exist almost everywhere in real world. Irregular objects packing problems are more complex than regular ones. In this study, a methodology that hybridizes a two-stage packing approach based on grid approximation with an integer representation based genetic algorithm (GA) is proposed to obtain an efficient allocation of irregular objects in a stock sheet of infinite length and fixed width without overlap. The effectiveness of the proposed methodology is validated by the experiments in the apparel industry, and the results demonstrate that the proposed method outperforms the commonly used bottom-left (BL) placement strategy in combination with random search (RS).
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2008.02.068