A hybrid genetic approach for garment cutting in the clothing industry

A hybrid genetic approach is proposed for the cutting operation in the clothing industry. Garment cutting is a typical strip-packing problem, which is considered to be NP-complete. With a combination of genetic algorithm (GA) and a novel heuristic algorithm, "lowest-fit-left-aligned," the cutting problem is transformed into a simple permutation problem which can be effectively solved by the GA and the searching domain is greatly reduced. From the simulation results, it is demonstrated that the optimal results can be obtained in a reasonably short period of time.

[1]  Peter Ross,et al.  A Study of Genetic Algorithm Hybrids for Facility Layout Problems , 1995, ICGA.

[2]  Henrik Esbensen,et al.  A genetic algorithm for macro cell placement , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

[3]  Brenda S. Baker,et al.  A 5/4 Algorithm for Two-Dimensional Packing , 1981, J. Algorithms.

[4]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[5]  Claire Mathieu,et al.  A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem , 2000, Math. Oper. Res..

[6]  Bernard T. Han,et al.  Optimal robot selection and workstation assignment for a CIM system , 1994, IEEE Trans. Robotics Autom..

[7]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[8]  Harald Dyckhoff,et al.  Cutting and Packing in Production and Distribution , 1992 .

[9]  A. Steinberg,et al.  A Strip-Packing Algorithm with Absolute Performance Bound 2 , 1997, SIAM J. Comput..

[10]  Claire Mathieu,et al.  Approximate strip packing , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[11]  Ingo Schiermeyer,et al.  Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles , 1994, ESA.