Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10304
Title: Solving the two-dimensional irregular objects allocation problems by using a two-stage packing approach
Authors: Wong, WK 
Wang, XX
Mok, PY 
Leung, SYS 
Kwong, CK 
Keywords: Genetic algorithms
Grid approximation
Irregular objects packing
Issue Date: 2009
Publisher: Pergamon Press
Source: Expert systems with applications, 2009, v. 36, no. 2 part 2, p. 3489-3496 How to cite?
Journal: Expert systems with applications 
Abstract: 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).
URI: http://hdl.handle.net/10397/10304
ISSN: 0957-4174
EISSN: 1873-6793
DOI: 10.1016/j.eswa.2008.02.068
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Aug 14, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
1
Citations as of Aug 13, 2017

Page view(s)

30
Last Week
0
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.