Journal of the Korean Society of Manufacturing Technology Engineers (한국생산제조학회지)

The Korean Society of Manufacturing Technology Engineers (한국생산제조학회)
권호 표지
DOI QR코드

DOI QR Code

Study on Hybrid Search Method Using Neural Network and Simulated Annealing Algorithm for Apparel Pattern Layout Design

뉴럴 네트워크와 시뮬레이티드 어닐링법을 하이브리드 탐색 형식으로 이용한 어패럴 패턴 자동배치 프로그램에 관한 연구

  • Jang, Seung Ho (Department of Mechanical Engineering, College of Engineering, Kyunghee University)
  • Received : 2014.07.04
  • Accepted : 2015.01.08
  • Published : 2015.02.15
Download PDF
⟨ Previous Next ⟩

Abstract

Pattern layout design is very important to the automation of apparel industry. Until now, the genetic algorithm and Tabu search method have been applied to layout design automation. With the genetic algorithm and Tabu search method, the obtained values are not always consistent depending on the initial conditions, number of iterations, and scheduling. In addition, the selection of various parameters for these methods is not easy. This paper presents a hybrid search method that uses a neural network and simulated annealing to solve these problems. The layout of pattern elements was optimized to verify the potential application of the suggested method to apparel pattern layout design.

Keywords

References

  1. Jakobs, S., 1996, On Genetic Algorithms for the Packing of Polygons, European Journal of Operational Research, 88:1 165-181. https://doi.org/10.1016/0377-2217(94)00166-9
  2. Sul, L. H., Kang, T. J., 2002, Optimal Marking of Garment Pattern using Rectilinear Polygon Approximation, International Journal of Clothing Science and Technology, 14:5 334-346. https://doi.org/10.1108/09556220210446149
  3. Murata, H., Fujiyashi, K., Nakatake, S., Kajitani, Y., 1995, Rectangle Packing Based Module Placement, IEEE, Proc. of ICADD 95, 472-479.
  4. Yamazaki, H., Sakanushi, K., Kajitani, Y., 2000, Optimum Packing of Convex Polygons by a New Data Structure Sequence-table, IEEE APCCAS 2000, 821-824.
  5. Jain, S., Gea, H. C., 1996, Two Dimensional Packing Problem using Genetic Algorithm, Proceeding of the 1996 ASME, Design Engineering Technical Conference and Computers in Engineering Conference, 1-8.
  6. Glover, F., 1989, Tabu Search-Part 1, ORSA Journal on Computing, 1 190-206. https://doi.org/10.1287/ijoc.1.3.190
  7. Waggenspack, L., Dobson, G. T., 1996, Nesting of Complex 2-D Part within Irregular Boundaries, ASME, 118 1087-1357.
  8. Elkeran, A., 2013, A New Approach for Sheet Nesting Problem using Guided Cuckoo Search and Pairwise Clustering, European Journal of Operational Research, 231:3 757-769. https://doi.org/10.1016/j.ejor.2013.06.020
  9. Bennell, J., Olieira, J., 2008, The Geometry of Nesting Problem : A Tutorial, European Journal of Operational Research, 184:2 397-415. https://doi.org/10.1016/j.ejor.2006.11.038
  10. Rutenbar, R. A., 1989, Simulated Annealing Algorithms : An Overview, IEEE Circuits and Devices Magazine, 5 19-26. https://doi.org/10.1109/101.17235
  11. Laarhoven, P. J. M., Aarts, E. H. L., 1987, Simulated Annealing : Theory and Applications, Reidel Publisher, USA.
  12. Sugiura, H., Jang, S., Nakajima, N., 1992, Application of the Simulated Annealing Method to the 3-Dimensional Layout Design Problem, JSME, 91 1021-1043.
  13. Ginnenken, O., 1989, The Annealing Algorithm, Kluwer Academic Publisher, USA, 15-18.