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

Authors:
W. K. Wong;X. X. Wang;P. Y. Mok;S. Y. S. Leung;C. K. Kwong
Affiliations:
Institute of Textiles and Clothing, The Hong Kong Polytechnic University, Hunghom, Kowloon, Hong Kong;Institute of Textiles and Clothing, The Hong Kong Polytechnic University, Hunghom, Kowloon, Hong Kong;Institute of Textiles and Clothing, The Hong Kong Polytechnic University, Hunghom, Kowloon, Hong Kong;Institute of Textiles and Clothing, The Hong Kong Polytechnic University, Hunghom, Kowloon, Hong Kong;Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hunghom, Kowloon, Hong Kong
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 7
Cited 0

Using a tabu search approach for solving the two-dimensional irregular cutting problem

Annals of Operations Research - Special issue on Tabu search
On two dimensional packing

Journal of Algorithms
The irregular cutting-stock problem mdash; a new procedure for deriving the no-fit polygon

Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Job Shop Scheduling with Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting

Management Science

Quantified Score

Hi-index	12.06

Visualization

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).