Robust handling of non-linear constraints for GA optimization of aerodynamic shapes
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contr...
Saved in:
Published in | International journal for numerical methods in fluids Vol. 45; no. 12; pp. 1339 - 1362 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Chichester, UK
John Wiley & Sons, Ltd
30.08.2004
Wiley |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. |
---|---|
Bibliography: | istex:AECC3794664E083DCED4714C0380EDF2A278A37F ArticleID:FLD747 ark:/67375/WNG-7B523QZP-V Consultant to IAI. ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0271-2091 1097-0363 |
DOI: | 10.1002/fld.747 |