Optimal Connection Algorithm of Two Kinds of Parts to Pairs using Hopfield Network

Hopfield Network를 이용한 이종 부품 결합의 최적화 알고리즘

  • 오제휘 (㈜ 동방 화닉스) ;
  • 차영엽 (원광 대학교 기계공학부) ;
  • 고경용 (원광 대학교 기계공학과 대학원)
  • Published : 1999.02.01

Abstract

In this paper, we propose an optimal algorithm for finding the shortest connection of two kinds of parts to pairs. If total part numbers are of size N, then there are order 2ㆍ(N/2)$^{N}$ possible solutions, of which we want the one that minimizes the energy function. The appropriate dynamic rule and parameters used in network are proposed by a new energy function which is minimized when 3-constraints are satisfied. This dynamic nile has three important parameters, an enhancement variable connected to pairs, a normalized distance term and a time variable. The enhancement variable connected to pairs have to a perfect connection of two kinds of parts to pairs. The normalized distance term get rids of a unstable states caused by the change of total part numbers. And the time variable removes the un-optimal connection in the case of distance constraint and the wrong or not connection of two kinds of parts to pairs. First of all, we review the theoretical basis for Hopfield model and present a new energy function. Then, the connection matrix and the offset bias created by a new energy function and used in dynamic nile are shown. Finally, we show examples through computer simulation with 20, 30 and 40 parts and discuss the stability and feasibility of the resultant solutions for the proposed connection algorithm.m.

Keywords