Proceedings of the KSME Conference (대한기계학회:학술대회논문집)
- 2004.04a
- /
- Pages.1005-1010
- /
- 2004
Local Solution of Sequential Algorithm Using Orthogonal Arrays in Discrete Design Space
이산설계공간에서 직교배열표를 이용한 순차적 알고리듬의 국부해
- Published : 2004.04.28
Abstract
The structural optimization has been carried out in the continuous design space or in the discrete design space. Generally, available designs are discrete in design practice. But methods for discrete variables are extremely expensive in computational cost. In order to overcome this weakness, an iterative optimization algorithm was proposed for design in the discrete space, which is called as a sequential algorithm using orthogonal arrays (SOA). We focus to verify the fact that the local solution can be obtained throughout the optimization with this algorithm. The local solution is defined in discrete design space. Then the search space, which is the set of candidate values of each design variables formed by the neighborhood of current design point, is defined. It is verified that a local solution can be founded by moving sequentially the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained using the SOA algorithm
Keywords