GATE: a genetic algorithm designed for expensive cost functions

The present paper introduces the GATE algorithm, which was specifically designed to lessen the cost of GAs for engineering design problems. The main strength of the algorithm is to find a good design using a relatively low number of function evaluations. The heart of the algorithm is a new heuristic called territorial core evolution (TE). TE regulates the mean step and the permitted search area of the GAs’ random search operators, depending on the state of convergence of the algorithm. As a result, more global or more local searches are made when necessary to better fit the specificities of each problem. GATE, which was initially calibrated using a Gaussian landscape generator as test case, is shown to be very efficient to solve that kind of topology, especially for large scale problems. Application of the GATE algorithm to various classical test cases allows a better understanding of the strengths and limitations of this algorithm.

[1]  R. Hinterding,et al.  Gaussian mutation and self-adaption for numeric genetic algorithms , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[2]  David E. Goldberg,et al.  Search space boundary extension method in real-coded genetic algorithms , 2001, Inf. Sci..

[3]  D Chambers,et al.  Model-based Layer Estimation using a Hybrid Genetic/Gradient Search Optimization Algorithm , 2007 .

[4]  Annie S. Wu,et al.  The Proportional Genetic Algorithm: Gene Expression in a Genetic Algorithm , 2002, Genetic Programming and Evolvable Machines.

[5]  Thomas Bäck,et al.  Empirical Investigation of Multiparent Recombination Operators in Evolution Strategies , 1997, Evolutionary Computation.

[6]  Zbigniew Michalewicz,et al.  Boundary Operators for Constrained Parameter Optimization Problems , 1997, ICGA.

[7]  Morikazu Nakamura,et al.  Parallel genetic algorithms on line topology of heterogeneous computing resources , 2005, GECCO '05.

[8]  P. Vadstrup,et al.  Parameter identification of induction motors using differential evolution , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[9]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[10]  Marcus Gallagher,et al.  Statistical Racing Techniques for Improved Empirical Evaluation of Evolutionary Algorithms , 2004, PPSN.

[11]  Yan Zhou,et al.  A memetic co-evolutionary differential evolution algorithm for constrained optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[12]  C.S. Chang,et al.  Application of differential evolution for harmonic worst-case identification of mass rapid transit power supply system , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[13]  Marcus Gallagher,et al.  On building a principled framework for evaluating and testing evolutionary algorithms: a continuous landscape generator , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[14]  N. Garc'ia-Pedrajas,et al.  CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features , 2005, J. Artif. Intell. Res..

[15]  Shigeyoshi Tsutsui,et al.  Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms , 2000, GECCO.

[16]  Stéphane Dominique.  Algorithme intelligent d'optimisation d'un design structurel de grande envergure , 2009 .

[17]  Andy J. Keane,et al.  An efficient evolutionary optimisation framework applied to turbine blade firtree root local profiles , 2005 .

[18]  Meghna Babbar-Sebens,et al.  A Case-Based Micro Interactive Genetic Algorithm (CBMIGA) for interactive learning and search: Methodology and application to groundwater monitoring design , 2010, Environ. Model. Softw..

[19]  Hitoshi Iba,et al.  Accelerating Differential Evolution Using an Adaptive Local Search , 2008, IEEE Transactions on Evolutionary Computation.