Optimal Algorithm of Path in the Part-Matching Process

부품 조립 공정에서 경로의 최적화 알고리즘

  • Oh, Je-Hui ;
  • Cha, Young-Youp
  • 오제휘 (원광대학교 대학원) ;
  • 차영엽 (원광대학교 기계설계공학과)
  • Published : 1997.08.01

Abstract

In this paper, we propose a Hopfield model for solving the part-matching in case that is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and total path of part-connections. Therefore, this kind of problem is referred to as a combinatiorial optimization problem. First of all, we review the theoretical basis for Hopfield model and present two optimal algorithms of part-matching. The first algorithm is Traveling Salesman Problem(TSP) which improved the original and the second algorithm is Wdighted Matching Problem (WMP). Finally, we show demonstration through com- puter simulation and analyze the stability and feasibility of the generated solutions for the proposed con- nection methods. Therefore, we prove that the second algorithm is better than the first algorithm.

Keywords