Parameter Control in Evolutionary Algorithms

The issue of setting the values of various parameters of an evolutionary algorithm is crucial for good performance. In this paper we discuss how to do this, beginning with the issue of whether these values are best set in advance or are best changed during evolution. We provide a classification of different approaches based on a number of complementary features, and pay special attention to setting parameters on-the-fly. This has the potential of adjusting the algorithm to the problem while solving the problem. This paper is intended to present a survey rather than a set of prescriptive details for implementing an EA for a particular type of problem. For this reason we have chosen to interleave a number of examples throughout the text. Thus we hope to both clarify the points we wish to raise as we present them, and also to give the reader a feel for some of the many possibilities available for controlling different parameters. © Springer-Verlag Berlin Heidelberg 2007.

[1]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[2]  John Daniel. Bagley,et al.  The behavior of adaptive systems which employ genetic and correlation algorithms : technical report , 1967 .

[3]  R. Rosenberg.  Simulation of genetic populations with biochemical properties : technical report , 1967 .

[4]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[5]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[6]  Anne Brindle,et al.  Genetic algorithms for function optimization , 1980 .

[7]  Editors , 1986, Brain Research Bulletin.

[8]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  C. G. Shaefer,et al.  The ARGOT Strategy: Adaptive Representation Genetic Optimizer Technique , 1987, ICGA.

[10]  J. David Schaffer,et al.  An Adaptive Crossover Distribution Mechanism for Genetic Algorithms , 1987, ICGA.

[11]  David E. Goldberg,et al.  Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy , 1987, ICGA.

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  Rajarshi Das,et al.  A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[14]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[15]  Terence C. Fogarty,et al.  Varying the Probability of Mutation in the Genetic Algorithm , 1989, ICGA.

[16]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[17]  Dirk Van Gucht,et al.  The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem , 1989 .

[18]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[19]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[20]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[21]  Gilbert Syswerda,et al.  A Study of Reproduction in Generational and Steady State Genetic Algorithms , 1990, FOGA.

[22]  Reinhard Männer,et al.  Towards an Optimal Mutation Probability for Genetic Algorithms , 1990, PPSN.

[23]  L. Darrell Whitley,et al.  Delta Coding: An Iterative Search Strategy for Genetic Algorithms , 1991, ICGA.

[24]  Zbigniew Michalewicz,et al.  An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms , 1991, ICGA.

[25]  Larry J. Eshelman,et al.  On Crossover as an Evolutionarily Viable Strategy , 1991, ICGA.

[26]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[27]  Thomas Bck,et al.  Self-adaptation in genetic algorithms , 1991 .

[28]  Hugh M. Cartwright,et al.  Looking Around: Using Clues from the Data Space to Guide Genetic Algorithm Searches , 1991, ICGA.

[29]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[30]  L. Darrell Whitley,et al.  Remapping Hyperspace During Genetic Search: Canonical Delta Folding , 1992, FOGA.

[31]  Kalyanmoy Deb,et al.  Accounting for Noise in the Sizing of Populations , 1992, FOGA.

[32]  Thomas Bäck,et al.  The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm , 1992, PPSN.

[33]  Yukinori Kakazu,et al.  Adaptive Search Strategy for Genetic Algorithms with Additional Genetic Algorithms , 1992, PPSN.

[34]  Joe Suzuki.  A Markov Chain Analysis on A Genetic Algorithm , 1993, ICGA.

[35]  Stephen I. Gallant.  Simulated Annealing and Boltzmann Machines , 1993 .

[36]  TopicsDavid,et al.  An Overview of Genetic Algorithms : Part 2 , Research , 1993 .

[37]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[38]  David B. Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[39]  Robert E. Smith,et al.  Adaptively Resizing Populations: An Algorithm and Analysis , 1993, ICGA.

[40]  Bull,et al.  An Overview of Genetic Algorithms: Pt 2, Research Topics , 1993 .

[41]  Alice E. Smith,et al.  Expected Allele Coverage and the Role of Mutation in Genetic Algorithms , 1993, ICGA.

[42]  Stephanie Forrest,et al.  Proceedings of the 5th International Conference on Genetic Algorithms , 1993 .

[43]  Alice E. Smith,et al.  Genetic Optimization Using A Penalty Function , 1993, ICGA.

[44]  Larry J. Eshelman,et al.  Crossover's Niche , 1993, ICGA.

[45]  Dirk Thierens,et al.  Toward a Better Understanding of Mixing in Genetic Algorithms , 1993 .

[46]  B. Freisleben,et al.  Optimization of Genetic Algorithms by Genetic Algorithms , 1993 .

[47]  Atidel B. Hadj-Alouane,et al.  A dual genetic algorithm for bounded integer programs James C. Bean, Atidel Ben Hadj-Alouane. , 1993 .

[48]  Hideyuki Takagi,et al.  Dynamic Control of Genetic Algorithms Using Fuzzy Logic Techniques , 1993, ICGA.

[49]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[50]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[51]  Zbigniew Michalewicz,et al.  GAVaPS-a genetic algorithm with varying population size , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[52]  Dirk Schlierkamp Voosen.  Strategy Adaptation by Competing Subpopulations , 1994 .

[53]  Tony White,et al.  Adaptive Crossover Using Automata , 1994, PPSN.

[54]  F. Greene.  A method for utilizing diploid/dominance in genetic search , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[55]  Zbigniew Michalewicz,et al.  Evolutionary optimization of constrained problems , 1994 .

[56]  James Bowen,et al.  Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[57]  Jan Paredis,et al.  Co-evolutionary Constraint Satisfaction , 1994, PPSN.

[58]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[59]  L. Darrell Whitley,et al.  Changing Representations During Search: A Comparative Study of Delta Coding , 1994, Evolutionary Computation.

[60]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[61]  A. E. Eiben,et al.  GA-easy and GA-hard Constraint Satisfaction Problems , 1995, Constraint Processing, Selected Papers.

[62]  Peter J. Angeline,et al.  Adaptive and Self-adaptive Evolutionary Computations , 1995 .

[63]  William M. Spears,et al.  Adapting Crossover in Evolutionary Algorithms , 1995, Evolutionary Programming.

[64]  Byoung-Tak Zhang,et al.  Balancing Accuracy and Parsimony in Genetic Programming , 1995, Evolutionary Computation.

[65]  Annie S. Wu,et al.  Empirical Studies of the Genetic Algorithm with Noncoding Segments , 1995, Evolutionary Computation.

[66]  Bryant A. Julstrom,et al.  What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm , 1995, ICGA.

[67]  Thomas Bäck,et al.  A Comparative Study of a Penalty Function, a Repair Heuristic and Stochastic Operators with the Set-Covering Problem , 1995, Artificial Evolution.

[68]  Günter Rudolph,et al.  A cellular genetic algorithm with self-adjusting acceptance threshold , 1995 .

[69]  Z. Michalewicz.  Genetic Algorithms , Numerical Optimization , and Constraints , 1995 .

[70]  Marimuthu Palaniswami,et al.  Computational Intelligence: A Dynamic System Perspective , 1995 .

[71]  Robert E. Smith,et al.  Adaptively Resizing Populations: Algorithm, Analysis, and First Results , 1993, Complex Syst..

[72]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[73]  Michael D. Vose,et al.  Modeling Simple Genetic Algorithms , 1995, Evolutionary Computation.

[74]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[75]  Jan Paredis,et al.  The Symbiotic Evolution of Solutions and Their Representations , 1995, International Conference on Genetic Algorithms.

[76]  David B. Fogel,et al.  An Evolutionary Programming Approach to Self-Adaptation on Finite State Machines , 1995, Evolutionary Programming.

[77]  Larry J. Eshelman,et al.  Proceedings of the 6th International Conference on Genetic Algorithms , 1995 .

[78]  H. IBA,et al.  Recombination guidance for numerical genetic programming , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

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

[80]  Jan Paredis,et al.  Coevolutionary Computation , 1995, Artificial Life.

[81]  D. Fogel,et al.  A comparison of methods for self-adaptation in evolutionary algorithms. , 1995, Bio Systems.

[82]  James Bowen,et al.  Solving randomly generated constraint satisfaction problems using a micro-evolutionary hybrid that evolves a population of hill-climbers , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[83]  Nikolaus Hansen,et al.  On the Adaptation of Arbitrary Normal Mutation Distributions in Evolution Strategies: The Generating Set Adaptation , 1995, ICGA.

[84]  A. E. Eiben,et al.  Self-adaptivity for constraint satisfaction: learning penalty functions , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[85]  Jim Smith,et al.  Recombination strategy adaptation via evolution of gene linkage , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[86]  Hitoshi Iba,et al.  Extending genetic programming with recombinative guidance , 1996 .

[87]  Peter Ross,et al.  Cost Based Operator Rate Adaption: An Investigation , 1996, PPSN.

[88]  John R. Koza.  Proceedings of the 1st annual conference on genetic programming , 1996 .

[89]  T. Soule,et al.  Using genetic programming to approximate maximum clique , 1996 .

[90]  Terence C. Fogarty,et al.  A Genetic Algorithm with Variable Range of Local Search for Tracking Changing Environments , 1996, PPSN.

[91]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[92]  Kalyanmoy Deb,et al.  Analysis of Selection Algorithms: A Markov Chain Approach , 1996, Evolutionary Computation.

[93]  Peter J. Angeline,et al.  Two self-adaptive crossover operators for genetic programming , 1996 .

[94]  Joanna Lis,et al.  Parallel genetic algorithm with the dynamic control parameter , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[95]  Jim Smith,et al.  Adaptively Parameterised Evolutionary Systems: Self-Adaptive Recombination and Mutation in a Genetic Algorithm , 1996, PPSN.

[96]  Heinz Mühlenbein,et al.  Adaptation of population sizes by competing subpopulations , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[97]  David B. Fogel,et al.  A Comparison of Self-Adaptation Methods for Finite State Machines in Dynamic Environments , 1996, Evolutionary Programming.

[98]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[99]  Dirk Thierens.  Dimensional Analysis of Allele-Wise Mixing Revisited , 1996, PPSN.

[100]  Thomas Bäck,et al.  Intelligent Mutation Rate Control in Canonical Genetic Algorithms , 1996, ISMIS.

[101]  David B. Fogel,et al.  A Preliminary Investigation into Directed Mutations in Evolutionary Algorithms , 1996, PPSN.

[102]  Jim Smith,et al.  Self adaptation of mutation rates in a steady state genetic algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[103]  Nikolaus Hansen,et al.  Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[104]  Zbigniew Michalewicz,et al.  Self-Adaptive Genetic Algorithm for Numeric Functions , 1996, PPSN.

[105]  Annie S. Wu,et al.  Empirical Observations on the Roles of Crossover and Mutation , 1997, ICGA.

[106]  Wolfgang Banzhaf,et al.  Genetic Programming: An Introduction , 1997 .

[107]  Jim Smith,et al.  Operator and parameter adaptation in genetic algorithms , 1997, Soft Comput..

[108]  Zbigniew Michalewicz,et al.  Adaptation in evolutionary computation: a survey , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[109]  A. E. Eiben,et al.  Adaptive Penalties for Evolutionary Graph Coloring , 1997, Artificial Evolution.

[110]  Astro Teller,et al.  Automatically Choosing the Number of Fitness Cases: The Rational Allocation of Trials , 1997 .

[111]  Peter J. Angeline,et al.  Tracking Extrema in Dynamic Environments , 1997, Evolutionary Programming.

[112]  E. E. Universitygusz.  Multi-parent Recombination , 1997 .

[113]  R. Hinterding.  Self-adaptation using multi-chromosomes , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[114]  ProgrammingJustinian P. RoscaComputer.  Analysis of Complexity Drift in Genetic , 1997 .

[115]  Samir W. Mahfoud.  Boltzmann selection , 2018, Evolutionary Computation 1.

[116]  T. Soule,et al.  Code Size and Depth Flows in Genetic Programming , 1997 .

[117]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[118]  David B. Fogel,et al.  Evolutionary algorithms in theory and practice , 1997, Complex.

[119]  Jeffrey Horn,et al.  Handbook of evolutionary computation , 1997 .

[120]  Terence C. Fogarty,et al.  Learning the local search range for genetic optimisation in nonstationary environments , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[121]  Paulien Hogeweg,et al.  Evolutionary Consequences of Coevolving Targets , 1997, Evolutionary Computation.

[122]  Xin Yao,et al.  An Analysis of Evolutionary Algorithms Based on Neighborhood and Step Sizes , 1997, Evolutionary Programming.

[123]  F. Greene.  Performance of Diploid Dominance with Genetically Synthesized Signal Processing Networks , 1997, ICGA.

[124]  Jano I. van Hemert,et al.  Graph Coloring with Adaptive Evolutionary Algorithms , 1998, J. Heuristics.

[125]  Zbigniew Michalewicz,et al.  Inver-over Operator for the TSP , 1998, PPSN.

[126]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[127]  Zbigniew Michalewicz,et al.  A Decoder-Based Evolutionary Algorithm for Constrained Parameter Optimization Problems , 1998, PPSN.

[128]  Elena Marchiori,et al.  Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function , 1998, PPSN.

[129]  T. Back,et al.  On the behavior of evolutionary algorithms in dynamic environments , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[130]  Thomas Bäck,et al.  A Superior Evolutionary Algorithm for 3-SAT , 1998, Evolutionary Programming.

[131]  A.E. Eiben,et al.  Competing crossovers in an adaptive GA framework , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[132]  David B. Fogel,et al.  An Introduction to Evolutionary Computation , 2022 .

[133]  Jano I. van Hemert,et al.  Adapting the Fitness Function in GP for Data Mining , 1999, EuroGP.

[134]  James R. Levenick,et al.  Swappers: introns promote flexibility, diversity and invention , 1999 .

[135]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[136]  Wolfgang Banzhaf,et al.  Empirical analysis of different levels of meta-evolution , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[137]  David E. Goldberg,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

[138]  Jano van Hemert,et al.  SAW-ing EAs: adapting the fitness function for solving constrained problems , 1999 .

[139]  Ben Paechter,et al.  Solving CSPs using self-adaptive constraint weights: how to prevent EAs from cheating , 2000, GECCO.

[140]  Thomas Bäck,et al.  An Empirical Study on GAs "Without Parameters" , 2000, PPSN.

[141]  N. Krasnogor,et al.  A Memetic Algorithm With Self-Adaptive Local Search: TSP as a case study , 2000, GECCO.

[142]  D. Fogel,et al.  Case studies in applying fitness distributions in evolutionary algorithms. II. Comparing the improvements from crossover and Gaussian mutation on simple neural networks , 2000, 2000 IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks. Proceedings of the First IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks (Cat. No.00.

[143]  Kalyanmoy Deb,et al.  Self-Adaptive Genetic Algorithms with Simulated Binary Crossover , 2001, Evolutionary Computation.

[144]  Akira Oyama,et al.  Real-coded adaptive range genetic algorithm applied to transonic wing optimization , 2000, Appl. Soft Comput..

[145]  Natalio Krasnogor,et al.  Emergence of profitable search strategies based on a simple inheritance mechanism , 2001 .

[146]  Edwin D. de Jong,et al.  Reducing bloat and promoting diversity using multi-objective methods , 2001 .

[147]  Jim Smith,et al.  Modelling gas with self adaptive mutation rates , 2001 .

[148]  A. Eiben.  Evolutionary algorithms and constraint satisfaction: definitions, survey, methodology, and research directions , 2001 .

[149]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[150]  Jim Smith,et al.  Parameter Perturbation Mechanisms in Binary Coded GAs with Self-Adaptive Mutation , 2002, FOGA.

[151]  Petros Koumoutsakos,et al.  Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) , 2003, Evolutionary Computation.

[152]  Ehl Emile Aarts,et al.  Simulated annealing and Boltzmann machines , 2003 .

[153]  N. Schraudolph,et al.  Dynamic Parameter Encoding for genetic algorithms , 2004, Machine Learning.

[154]  James Smith,et al.  On Appropriate Adaptation Levels for the Learning of Gene Linkage , 2002, Genetic Programming and Evolvable Machines.

[155]  J. W. Atmar,et al.  Comparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systems , 1990, Biological Cybernetics.

[156]  Zbigniew Michalewicz,et al.  Forecasting with a Dynamic Window of Time: The DyFor Genetic Program Model , 2004, IMTCI.

[157]  Michael D. Vose,et al.  Modeling genetic algorithms with Markov chains , 1992, Annals of Mathematics and Artificial Intelligence.

[158]  Neal Wagner,et al.  Genetic Programming with Efficient Population Control for Financial Time Series Prediction , 2005 .

[159]  Peter A. N. Bosman,et al.  Proceedings of the Genetic and Evolutionary Computation Conference - GECCO - 2006 , 2006 .

[160]  Christopher R. Stephens,et al.  "Optimal" mutation rates for genetic search , 2006, GECCO.

[161]  Hans-Georg Beyer,et al.  Self-Adaptation in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[162]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .