You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/21786
Title: 
Efficient robust optimization based on polynomial chaos and tabu search algorithm
Author(s): 
Institution: 
  • Zhejiang Univ
  • Universidade Estadual Paulista (UNESP)
ISSN: 
1383-5416
Abstract: 
The study of robust design methodologies and techniques has become a new topical area in design optimizations in nearly all engineering and applied science disciplines in the last 10 years due to inevitable and unavoidable imprecision or uncertainty which is existed in real word design problems. To develop a fast optimizer for robust designs, a methodology based on polynomial chaos and tabu search algorithm is proposed. In the methodology, the polynomial chaos is employed as a stochastic response surface model of the objective function to efficiently evaluate the robust performance parameter while a mechanism to assign expected fitness only to promising solutions is introduced in tabu search algorithm to minimize the requirement for determining robust metrics of intermediate solutions. The proposed methodology is applied to the robust design of a practical inverse problem with satisfactory results.
Issue Date: 
1-Jan-2012
Citation: 
International Journal of Applied Electromagnetics and Mechanics. Amsterdam: IOS Press, v. 39, n. 1-4, p. 145-150, 2012.
Time Duration: 
145-150
Publisher: 
IOS Press
Keywords: 
  • Robust design
  • polynomial chaos
  • design optimization
  • tabu search algorithm
Source: 
http://dx.doi.org/10.3233/JAE-2012-1454
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/21786
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

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