An asynchronous metamodel-assisted memetic algorithm for CFD-based shape optimization

This article presents an asynchronous metamodel-assisted memetic algorithm for the solution of CFD-based optimization problems. This algorithm is appropriate for use on multiprocessor platforms and may solve computationally expensive optimization problems in reduced wall-clock time, compared to conv...

Full description

Saved in:
Bibliographic Details
Published inEngineering optimization Vol. 44; no. 2; pp. 157 - 173
Main Authors Kontoleontos, Evgenia A., Asouti, Varvara G., Giannakoglou, Kyriakos C.
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 01.02.2012
Taylor & Francis Ltd
Subjects
Online AccessGet full text
ISSN0305-215X
1026-745X
1029-0273
1029-0273
DOI10.1080/0305215X.2011.570758

Cover

More Information
Summary:This article presents an asynchronous metamodel-assisted memetic algorithm for the solution of CFD-based optimization problems. This algorithm is appropriate for use on multiprocessor platforms and may solve computationally expensive optimization problems in reduced wall-clock time, compared to conventional evolutionary or memetic algorithms. It is, in fact, a hybridization of non-generation-based (asynchronous) evolutionary algorithms, assisted by surrogate evaluation models, a local search method and the Lamarckian learning process. For the objective function gradient computation, in CFD applications, the adjoint method is used. Issues concerning the 'smart' implementation of local search in multi-objective problems are discussed. In this respect, an algorithmic scheme for reducing the number of calls to the adjoint equations to just one, irrespective of the number of objectives, is proposed. The algorithm is applied to the CFD-based shape optimization of the tubes of a heat exchanger and of a turbomachinery cascade.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0305-215X
1026-745X
1029-0273
1029-0273
DOI:10.1080/0305215X.2011.570758