대한기계학회:학술대회논문집 (Proceedings of the KSME Conference)
- 대한기계학회 2004년도 추계학술대회
- /
- Pages.858-863
- /
- 2004
이산공간에서 순차적 알고리듬(SOA)을 이용한 전역최적화
Global Optimization Using a Sequential Algorithm with Orthogonal Arrays in Discrete Space
- 발행 : 2004.11.03
초록
In the optimized design of an actual structure, the design variable should be selected among any certain values or corresponds to a discrete design variable that needs to handle the size of a pre-formatted part. Various algorithms have been developed for discrete design. As recently reported, the sequential algorithm with orthogonal arrays(SOA), which is a local minimum search algorithm in discrete space, has excellent local minimum search ability. It reduces the number of function evaluation using orthogonal arrays. However it only finds a local minimum and the final solution depends on the initial value. In this research, the genetic algorithm, which defines an initial population with the potential solution in a global space, is adopted in SOA. The new algorithm, sequential algorithm with orthogonal arrays and genetic algorithm(SOAGA), can find a global solution with the properties of genetic algorithm and the solution is found rapidly with the characteristics of SOA.
키워드