시뮬레이티드 어닐링 알고리즘을 이용한 유연생산시스템의 기계셀-부품군 형성에 관한 연구

A Study of Formation of Machine Cell-Part Family in FMS using the Simulated Annealing Algorithm

  • 김진용 (여주전문대학 공업경영과) ;
  • 박대극 ((주) 대한항공 정보시스템실) ;
  • 오병완 (동국대학교 산업공학과) ;
  • 홍성조 (동국대학교 산업공학과) ;
  • 최진영 (경기대학교 산업공학과)
  • 투고 : 19960900
  • 발행 : 1997.07.31

초록

The problem of the formation of machine-part cells in FMS is a very important issue at the planning and operating stages of FMS. This problem is inherently a combinatorial optimization problem, proven to be NP-complete(or, NP-hard). Among the several kinds of approaches which have been applied to solve the combinatorial optimization problems, the Simulated Annealing(SA) algorithm, a technique of random search type with a flexibility in generating alternatives, is a powerful problem solving tool. In this paper, the SA algorithm is used to solve machine cell-part family formation problems. The primary purpose of the study is to find the near-optimal solution of machine cell-part family formation problem, whare the product volume and number of operations are prespecified, that can minimize the total material handling cost caused by exceptional elements and intercell moves as much as possible. The results show that the SA algorithm is able to find a near-optimal solution for practical problems of the machine cell-part family formation.

키워드