258 0

이산설계공간에서 직교배열표를 이용한 순차적 알고리듬의 국부해

Title
이산설계공간에서 직교배열표를 이용한 순차적 알고리듬의 국부해
Other Titles
Local Solution of a Sequential Algorithm Using Orthogonal Arrays in a Discrete Design Space
Author
박경진
Keywords
Discrete Design Space; 이산설계 공간; Orthogonal Arrays; 직교 배열표; Design o f Experiments; 실험계획법; Local Solution; 국부해; Structural Optimization; 구조최적설계
Issue Date
2004-09
Publisher
대한기계학회
Citation
대한기계학회논문집 A, v. 28, No. 9, Page. 1399-1407
Abstract
Structural optimization has been carried out in continuous design space or in discrete design space. Generally, available designs are discrete in design practice. However, the methods for discrete variables are extremely expensive in computational cost. An iterative optimization algorithm is proposed for design in a discrete space, which is called a sequential algorithm using orthogonal arrays (SOA). We demonstrate verifying the fact that a local optimum solution can be obtained from the process with this algorithm. The local optimum solution is defined in a discrete design space. Then the search space, which is a set of candidate values of each design variables formed by the neighborhood of a current design point, is defined. It is verified that a local optimum solution can be found by sequentially moving 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 by using the SOA algorithm.
URI
https://information.hanyang.ac.kr/#/eds/detail?an=edspia.572933&dbId=edspiahttps://repository.hanyang.ac.kr/handle/20.500.11754/151870
ISSN
1226-4873; 2288-5226
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > MECHANICAL ENGINEERING(기계공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE