A Hybrid Planning Process for Improving Fabric Utilization

In the textile and clothing industry, marker planning is a critical operation in the fabric-cutting room, in which pattern pieces of different sizes and styles of a garment are laid out on a sheet of paper with fixed width and arbitrary length in order to achieve the highest fabric utilization (marker efficiency). The layout always contains areas of unusable fabric due to the irregular shapes of garment pattern pieces. The minimization of fabric wastage is crucial to the reduction of production costs. In this study, a methodology that hybridizes a heuristic packing (HP) approach based on grid approximation with an integer representation-based (µ + λ) evolutionary strategy (ES) is proposed in order to obtain an efficient layout of garment patterns so as to optimize the fabric utilization. The performance of the proposed methodology is validated by the experiments and the results demonstrate that the proposed method provides an effective means by which to increase the marker efficiency.

[1]  José Fernando Oliveira,et al.  Algorithms for Nesting Problems , 1993 .

[2]  Thomas Lengauer,et al.  A simulated annealing approach to the nesting problem in the textile manufacturing industry , 1995, Ann. Oper. Res..

[3]  H. Gea,et al.  Two-dimensional packing problems using genetic algorithms , 2005, Engineering with Computers.

[4]  Suck-Joo Na,et al.  Two-Stage Approach for Nesting in Two-Dimensional Cutting Problems Using Neural Network and Simulated Annealing , 1996 .

[5]  K. Dejong,et al.  An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems , 1975 .

[6]  L. Fogel,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 1996 .

[7]  S. Maouche,et al.  Evolutionary search techniques application in automated layout-planning optimization problem , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[8]  K. Dowsland,et al.  A tabu thresholding implementation for the irregular stock cutting problem , 1999 .

[9]  K. Dowsland,et al.  Solution approaches to irregular nesting problems , 1995 .

[10]  S. Maouche,et al.  Irregular shape nesting and placing with evolutionary approach , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[11]  M. Hifi,et al.  A hybrid algorithm for the two‐dimensional layout problem: the cases of regular and irregular shapes , 2003 .

[12]  Graham Kendall,et al.  Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem , 2000 .

[13]  José Fernando Oliveira,et al.  A 2-exchange heuristic for nesting problems , 2002, Eur. J. Oper. Res..

[14]  Kathryn A. Dowsland,et al.  Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting , 2001, Manag. Sci..

[15]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[16]  Jacek Blazewicz,et al.  Using a tabu search approach for solving the two-dimensional irregular cutting problem , 1993, Ann. Oper. Res..

[17]  Rym M'Hallah,et al.  A Hybrid Genetic Algorithm for the Cut Order Planning Problem , 2007, IEA/AIE.

[18]  Yossi Azar,et al.  On Two Dimensional Packing , 1997, J. Algorithms.

[19]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[20]  José Fernando Oliveira,et al.  Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming , 2006, Eur. J. Oper. Res..

[21]  Rolf Harren.  Two-dimensional packing problems , 2010 .

[22]  Kikuo Fujita,et al.  Hybrid Approach for Optimal Nesting Using a Genetic Algorithm and a Local Minimization Algorithm , 1998 .

[23]  Graham Kendall,et al.  Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem , 1999, Australian Joint Conference on Artificial Intelligence.

[24]  V. Milenkovic,et al.  Compaction and separation algorithms for non-convex polygons and their applications☆ , 1995 .

[25]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[26]  M. V. Novozhilova,et al.  Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem , 1996 .

[27]  K.K.B. Hon,et al.  The Nesting of Two-Dimensional Shapes Using Genetic Algorithms , 1995 .

[28]  José Fernando Oliveira,et al.  TOPOS – A new constructive algorithm for nesting problems , 2000, OR Spectr..

[29]  Kathryn A. Dowsland,et al.  The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon , 2001, Comput. Oper. Res..