.png){kind=icon}
Return
An optimization algorithm using orthogonal arrays in discrete design space for structures
.png){kind=icon}
PRE
AI
DOI：10.1016/S0168-874X(03)00095-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Structural optimization has been carried out in continuous or discrete design space. Methods for discrete design such as genetic algorithms are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is proposed for design in discrete space. An orthogonal array is selected on a discrete design space and levels are chosen from candidate values. Matrix experiments with the orthogonal array are conducted. A characteristic function is defined to consider the constraint feasibility. A new design in a certain iteration is determined from analysis of means (ANOM) with the characteristic function. An orthogonal array is defined around the new values and matrix experiments are conducted again with the new orthogonal array. The final optimum design is found from the iterative process. Various structural problems are solved to show the validity of the proposed method. The results are compared with those from a genetic algorithm and discussed. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
structural optimization
discrete design
orthogonal array
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
2.6K
Citations:
5.1K
Organization
No organization information available
Cited Papers
ShareSaveGroup effect on fertility, survival and silk production in the web spinner Tetranychus urticae (Acari: Tetranychidae) during colony foundation.png)
Behaviour
BehaviourIF0
PREAI
ShareSaveImpacts of Plastic Filming on Growth Environment, Yield Parameters and Quality Attributes of Lettuce
OAAI
OAAIShareSaveShareSave
no more
no more