dc.contributorZhejiang Univ
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T14:01:43Z
dc.date.accessioned2022-10-05T14:48:51Z
dc.date.available2014-05-20T14:01:43Z
dc.date.available2022-10-05T14:48:51Z
dc.date.created2014-05-20T14:01:43Z
dc.date.issued2012-01-01
dc.identifierInternational Journal of Applied Electromagnetics and Mechanics. Amsterdam: IOS Press, v. 39, n. 1-4, p. 145-150, 2012.
dc.identifier1383-5416
dc.identifierhttp://hdl.handle.net/11449/21786
dc.identifier10.3233/JAE-2012-1454
dc.identifierWOS:000309602700020
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3895516
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.
dc.languageeng
dc.publisherIOS Press
dc.relationInternational Journal of Applied Electromagnetics and Mechanics
dc.relation0.804
dc.relation0,304
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectRobust design
dc.subjectpolynomial chaos
dc.subjectdesign optimization
dc.subjecttabu search algorithm
dc.titleEfficient robust optimization based on polynomial chaos and tabu search algorithm
dc.typeArtigo


Este ítem pertenece a la siguiente institución