A Study on Optimimum Packing of Patterns by Genetic Algorithm

패턴 최적배치를 위한 유전 알고리즘의 응용에 관한 연구

  • Park, Young-Seo (Faculty of Mechanical and Industrial System Engineering, Kyunghee University) ;
  • Jang, Sung-Ho (Faculty of Mechanical and Industrial System Engineering, Kyunghee University) ;
  • Huh, You (Faculty of Mechanical and Industrial System Engineering, Kyunghee University)
  • 박영서 (경희대학교 기계.산업시스템공학부) ;
  • 장승호 (경희대학교 기계.산업시스템공학부) ;
  • 허유 (경희대학교 기계.산업시스템공학부)
  • Published : 2003.08.01

Abstract

A good algorithm for optimum packing of materials is very important in that batch production of small quantities that requires a quirk response of the manufacturing system to the change in the market demand turns out to be an industrial trend. In spite of many researches on optimum packing, performance of pattern packing on the basis of computer aided automation if still inferior to that by manual operation from the material utilization point of view. In this paper we develop a software program based on genetic algorithm that is known to be proper for searching an optimal solution and try to ascertain whether the algorithm adopted is suitable and effective for improving the efficiency of the pattern laying process for apparel manufacturing. The pattern laying problem is divided into two parts: to determine a priority order of pattern and to achieve a high efficiency of materials by the order already given. For determining the order of placing patterns, a genetic algorithm was applied and for a pattern location a path pursuit algorithm. The results show that the pattern packing software, consisting of the genetic alogorithm and the path pursuit strategy used In this study, is one of the ways suitable for making the pattern laying process efficient and consistent, which was assessed indirectly by the random search method. The simulation reveals that the pattern laying efficiency of the method adopted in this study is about 85%, independent of the number of the pattern elements.

Keywords

References

  1. International J. of Clothing Sci. and Technol. v.14 no.5 Optimal Marking of Garment Pattern Using Rectilinear Polygon Approximation I.H.Sul;T.J.Kang
  2. ASME v.118 no.4 Nesting of Complex 2-D Parts within Irregular Boundaries L.Waggenspack;G.T.Dobson
  3. 메타휴리스틱 김여근;윤복식;이상복
  4. Simulated Annealing : Theory and Applications P.J.M.Van Laarhoven;E.H.L.Aarts
  5. The Annealing Algorithm O.Ginnenken
  6. IEEE Circuits and Devices Magazine v.5 no.1 Simulated Annealing Algorithms : An Overview R,A.Rutenbar
  7. ORSA Journal on Computing v.1 no.3 Tabu Search-Part F.Glover
  8. 대한산업공학회지 v.21 no.3 Jop Shop 일정계획을 위한 타부서치 김여근;배상윤'이덕성
  9. 유전자 알고리즘 北野宏明(조성배 역)
  10. Proceeding of the 1996 ASME, Design Engineering Technical Conference and Computers in Engineering Conference Two-Demensional Packing Problem Using Genetic Algorithm S.Jain;H.C.Gea
  11. European Journal of Operational Reasearch v.88 On Genetic Agorithms for the Packing of Polygons S.Jakobs
  12. IEEE, Proc. of ICADD 95 Rectangle-Packing-Based Module Placement H.Murata;K.Fujiyoshi