An optimization algorithm using orthogonal arrays in discrete design space for structures

Authors:
Kwon-Hee Lee;Jeong-Wook Yi;Joon-Seong Park;Gyung-Jin Park
Affiliations:
Department of Mechanical Engineering, Dong-A University, 840 Hadan-2-Dong, Saha-Gu, Busan 604-714, South Korea;Department of Mechanical Design and Production Engineering, Hanyang University, 17 Haengdang-Dong, Sungdong-Gu, Seoul 133-791, South Korea;Department of Mechanical Design and Production Engineering, Hanyang University, 17 Haengdang-Dong, Sungdong-Gu, Seoul 133-791, South Korea;Department of Mechanical Engineering, Hanyang University, Sa-l-Dong 1271, Ansan City 425-791, Kyunggi-Do, South Korea
Venue:
Finite Elements in Analysis and Design
Year:
2003

Citing 2
Cited 2

Quality Engineering Using Robust Design

Quality Engineering Using Robust Design
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

A step-by-step extending parallelism approach for enumeration of combinatorial objects

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Orthogonal design of experiments for parameter learning in image segmentation

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.