A hybrid genetic approach for garment cutting in the clothing industry

被引:24
作者
Yeung, LHW [1 ]
Tang, WKS [1 ]
机构
[1] City Univ Hong Kong, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China
关键词
clothing industry; cutting problem; genetic algorithm (GA); heuristic algorithm;
D O I
10.1109/TIE.2003.812285
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:449 / 455
页数:7
相关论文
共 13 条
[1]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[2]   ORTHOGONAL PACKINGS IN 2 DIMENSIONS [J].
BAKER, BS ;
COFFMAN, EG ;
RIVEST, RL .
SIAM JOURNAL ON COMPUTING, 1980, 9 (04) :846-855
[3]   A 5-4 ALGORITHM FOR TWO-DIMENSIONAL PACKING [J].
BAKER, BS ;
BROWN, DJ ;
KATSEFF, HP .
JOURNAL OF ALGORITHMS, 1981, 2 (04) :348-368
[4]  
COFFMAN EG, 1980, SIAM J COMPUT, V9, P808, DOI 10.1137/0209062
[5]   OPTIMAL ROBOT SELECTION AND WORK STATION ASSIGNMENT FOR A CIM SYSTEM [J].
COOK, JS ;
HAN, BT .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1994, 10 (02) :210-219
[6]  
Dyckhoff H., 1992, CUTTING PACKING PROD
[7]  
ESBENSEN H, 1992, P EUR DES AUT C EURO, P52
[8]  
*HONG KONG TRAD DE, 2001, PROF HONG KONG MAJ M
[9]  
KADO K, 1995, P 6 INT C GEN ALG, P498
[10]   A near-optimal solution to a two-dimensional cutting stock problem [J].
Kenyon, C ;
Rémila, E .
MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (04) :645-656