Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12288
Title: A fast robust optimization methodology based on polynomial chaos and evolutionary algorithm for inverse problems
Authors: Ho, SL 
Yang, S
Keywords: Evolutionary algorithm
Polynomial chaos expansion
Robust design
Robust optimization
Issue Date: 2012
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on magnetics, 2012, v. 48, no. 2, 6136632, p. 259-262 How to cite?
Journal: IEEE transactions on magnetics 
Abstract: This paper explores the potential of polynomial chaos in robust designs of inverse problems. A fast numerical methodology based on combinations of polynomial chaos expansion and evolutionary algorithm is reported in this study. With the proposed methodology, polynomial chaos expansion is used as a stochastic response surface model for efficient computations of the expectancy metric of the objective function. Additional enhancements, such as the introduction of a new methodology for expected fitness assignment and probability feasibility model, a novel driving mechanism to bias the next iterations to search for both global and robust optimal solutions, are introduced. Numerical results on two case studies are reported to illustrate the feasibility and merits of the present work.
URI: http://hdl.handle.net/10397/12288
ISSN: 0018-9464
EISSN: 1941-0069
DOI: 10.1109/TMAG.2011.2175438
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

14
Last Week
0
Last month
1
Citations as of Aug 20, 2017

WEB OF SCIENCETM
Citations

13
Last Week
0
Last month
1
Citations as of Aug 22, 2017

Page view(s)

38
Last Week
1
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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