Fitness uniform optimization

In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of fitter individuals. The right selection pressure is critical in ensuring sufficient optimization progress on the one hand and in preserving genetic diversity to be able to escape from local optima on the other hand. Motivated by a universal similarity relation on the individuals, we propose a new selection scheme, which is uniform in the fitness values. It generates selection pressure toward sparsely populated fitness regions, not necessarily toward higher fitness, as is the case for all other selection schemes. We show analytically on a simple example that the new selection scheme can be much more effective than standard selection schemes. We also propose a new deletion scheme which achieves a similar result via deletion and show how such a scheme preserves genetic diversity more effectively than standard approaches. We compare the performance of the new schemes to tournament selection and random deletion on an artificial deceptive problem and a range of NP hard problems: traveling salesman, set covering, and satisfiability

[1]  D. J. Cavicchio,et al.  Adaptive search using simulated evolution , 1970 .

[2]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[6]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[7]  James E. Baker,et al.  Adaptive Selection Methods for Genetic Algorithms , 1985, International Conference on Genetic Algorithms.

[8]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

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

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

[11]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[12]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[13]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[14]  David R. Jefferson,et al.  Selection in Massively Parallel Genetic Algorithms , 1991, ICGA.

[15]  Michael Herdy,et al.  Reproductive Isolation as Strategy Parameter in Hierarichally Organized Evolution Strategies , 1992, PPSN.

[16]  Heinz Mühlenbein,et al.  The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA) , 1993, Evolutionary Computation.

[17]  Bruce Tidor,et al.  An Analysis of Selection Procedures with Particular Attention Paid to Proportional and Boltzmann Selection , 1993, International Conference on Genetic Algorithms.

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

[19]  Heinz Mühlenbein,et al.  Strategy Adaption by Competing Subpopulations , 1994, PPSN.

[20]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[21]  Lothar Thiele,et al.  A Mathematical Analysis of Tournament Selection , 1995, ICGA.

[22]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..

[23]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[24]  Lothar Thiele,et al.  A Comparison of Selection Schemes Used in Evolutionary Algorithms , 1996, Evolutionary Computation.

[25]  Adam Prügel-Bennett,et al.  Modelling the Dynamics of a Steady State Genetic Algorithm , 1999, FOGA.

[26]  Adam Prügel-Bennett,et al.  Genetic drift in genetic algorithm selection schemes , 1999, IEEE Trans. Evol. Comput..

[27]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .

[28]  G. Rudolph On Takeover Times in Spatially Structured Populations : Array and Ring , 2001 .

[29]  Michael Mattes,et al.  Combining the Genetic Algorithm Approach and the Model-Based Parameter Estimation into an Adaptive Frequency Sampling Algorithm , 2001, 2001 31st European Microwave Conference.

[30]  Marcus Hutter,et al.  Fitness uniform selection to preserve genetic diversity , 2001, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[31]  Nancy Paterson The Library , 1912, Leonardo.

[32]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[33]  Shane Legg,et al.  Tournament versus fitness uniform selection , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[34]  Melanie Mitchell,et al.  What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation , 2004, Machine Learning.

[35]  Shane Legg,et al.  Fitness uniform deletion: a simple way to preserve diversity , 2005, GECCO '05.

[36]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.