Fitness uniform deletion: a simple way to preserve diversity

A commonly experienced problem with population based optimisation methods is the gradual decline in population diversity that tends to occur over time. This can slow a system's progress or even halt it completely if the population converges on a local optimum from which it cannot escape. In this paper we present the Fitness Uniform Deletion Scheme (FUDS), a simple but somewhat unconventional approach to this problem. Under FUDS the deletion operation is modified to only delete those individuals which are "common" in the sense that there exist many other individuals of similar fitness in the population. This makes it impossible for the population to collapse to a collection of highly related individuals with similar fitness. Our experimental results on a range of optimisation problems confirm this, in particular for deceptive optimisation problems the performance is significantly more robust to variation in the selection intensity.

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

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

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

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

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

[6]  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).

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

[8]  Samir W. Mahfoud Niching methods for genetic algorithms , 1996 .

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

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

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

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

[13]  Marcus Hutter,et al.  Fast Non-Parametric Bayesian Inference on Infinite Trees , 2004, AISTATS.

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

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

[16]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

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

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