Please use this identifier to cite or link to this item:
Title: Constrained robust optimal design using a multiobjective evolutionary algorithm
Authors: Ray, T. 
Issue Date: 2002
Citation: Ray, T. (2002). Constrained robust optimal design using a multiobjective evolutionary algorithm. Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002 1 : 419-424. ScholarBank@NUS Repository.
Abstract: A major fraction of evolutionary optimization methods aims to find solutions that maximize performance. However, a solution that solely maximizes performance is of no practical use as it may be too sensitive to parametric variations (nonuniform material properties, inexact physical dimensions, uncertainties in loading and operating conditions, etc.). Furthermore, for design problems with constraints, a robust solution needs to be feasible and remain feasible under parametric variations. In this paper, a new evolutionary algorithm is proposed that is capable of handling constrained robust optimal design problems. A multiobjective formulation is introduced that considers an individuals' performance, the mean performance of its neighbors and the standard deviation of its neighbors' performance as three objectives for optimization. In order to handle feasibility, an innovative constraint-handling scheme based on the Pareto concept is introduced that considers an individual's self-feasibility and its neighborhood feasibility. Robust optimal solutions to two engineering design examples are reported in this paper. Results of simulations are also presented to illustrate the differences between an optimal solution and a robust optimal solution. © 2002 IEEE.
Source Title: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002
DOI: 10.1109/CEC.2002.1006271
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Oct 14, 2018

Page view(s)

checked on Apr 19, 2018

Google ScholarTM



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