You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/21786
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWu, Lie-
dc.contributor.authorYang, Shiyou-
dc.contributor.authorBai, Yanan-
dc.contributor.authorMachado, Jose Marcio-
dc.date.accessioned2014-05-20T14:01:43Z-
dc.date.accessioned2016-10-25T17:08:44Z-
dc.date.available2014-05-20T14:01:43Z-
dc.date.available2016-10-25T17:08:44Z-
dc.date.issued2012-01-01-
dc.identifierhttp://dx.doi.org/10.3233/JAE-2012-1454-
dc.identifier.citationInternational Journal of Applied Electromagnetics and Mechanics. Amsterdam: IOS Press, v. 39, n. 1-4, p. 145-150, 2012.-
dc.identifier.issn1383-5416-
dc.identifier.urihttp://hdl.handle.net/11449/21786-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/21786-
dc.description.abstractThe 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.en
dc.format.extent145-150-
dc.language.isoeng-
dc.publisherIOS Press-
dc.sourceWeb of Science-
dc.subjectRobust designen
dc.subjectpolynomial chaosen
dc.subjectdesign optimizationen
dc.subjecttabu search algorithmen
dc.titleEfficient robust optimization based on polynomial chaos and tabu search algorithmen
dc.typeoutro-
dc.contributor.institutionZhejiang Univ-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationZhejiang Univ, Coll Elect Engn, Hangzhou 310027, Zhejiang, Peoples R China-
dc.description.affiliationSão Paulo State Univ, Sao Jose do Rio Preto, SP, Brazil-
dc.description.affiliationUnespSão Paulo State Univ, Sao Jose do Rio Preto, SP, Brazil-
dc.identifier.doi10.3233/JAE-2012-1454-
dc.identifier.wosWOS:000309602700020-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofInternational Journal of Applied Electromagnetics and Mechanics-
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.