Journal
EXPERT SYSTEMS WITH APPLICATIONS
Volume 36, Issue 2, Pages 3489-3496Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2008.02.068
Keywords
Irregular objects packing; Genetic algorithms; Grid approximation
Categories
Funding
- Earmarked Research Grant of Research Grants Council of Hong Kong
- The Hong Kong Polytechnic - University [529005]
Ask authors/readers for more resources
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 (IRS). (C) 2008 Published by Elsevier Ltd.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available