Advertisement

Soft Computing

, Volume 3, Issue 1, pp 44–51 | Cite as

A new mutation operator for evolutionary airfoil design

  • I. De Falco
  • A. Della Cioppa
  • A. Iazzetta
  • E. Tarantino
Original paper

Abstract

A new mutation operator, ℳ ijn , capable of operating on a set of adjacent bits in one single step, is introduced. Its features are examined and compared against those of the classical bit–flip mutation. A simple Evolutionary Algorithm, ℳ–EA, based only on selection and ℳ ijn , is described. This algorithm is used for the solution of an industrial problem, the Inverse Airfoil Design optimization, characterized by high search time to achieve satisfying solutions, and its performance is compared against that offered by a classical binary Genetic Algorithm. The experiments show for our algorithm a noticeable reduction in the time needed to reach a solution of acceptable quality, thus they prove the effectiveness of the proposed operator and its superiority to GAs for the problem at hand.

Key words evolutionary algorithms Co mutation airfoil optimization inverse design. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • I. De Falco
    • 1
  • A. Della Cioppa
    • 2
  • A. Iazzetta
    • 1
  • E. Tarantino
    • 1
  1. 1.Institute for Research on Parallel Information Systems (IRSIP) National Research Council of Italy (CNR) Via P. Castellino, 111 80131 Naples – Italy email: {ivan,iazzetta,ernesto}@irsip.na.cnr.itIT
  2. 2.Department of Computer Science and Systems University of Naples “Federico II” Via Claudio, 21 80125 Naples – Italy email: dean@unina.itIT

Personalised recommendations