직교배열표를 이용한 이산공간에서의 최적화 알고리즘 개발

Development of an Optimization Algorithm Using Orthogonal Arrays in Discrete Space

The structural optimization is carried out in the continuous design space or discrete design space. Methods for discrete variables such as genetic algorithms are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is developed for design in discrete space. An orthogonal array is selected on a discrete design space and levels are selected from candidate values. Matrix experiments with the orthogonal array are conducted. New results of matrix experiments are obtained with penalty functions for constraints. A new design is determined from analysis of means(ANOM). An orthogonal array is defined around the new values and matrix experiments are conducted. The final optimum design is found from iterative process. The suggested algorithm has been applied to various problems such as truss and frame type structures. The results are compared with those from a genetic algorithm and discussed.