Fitness Uniform Selection to Preserve Genetic Diversity
Marcus Hutter

TL;DR
This paper introduces a novel fitness uniform selection method in evolutionary algorithms that maintains genetic diversity by favoring sparsely populated fitness regions, improving optimization performance.
Contribution
The paper proposes a new selection scheme based on uniform fitness distribution, which differs from traditional methods by promoting diversity and avoiding premature convergence.
Findings
More effective than standard selection schemes
Preserves genetic diversity better
Helps escape local optima
Abstract
In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit 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. We propose a new selection scheme, which is uniform in the fitness values. It generates selection pressure towards sparsely populated fitness regions, not necessarily towards higher fitness, as is the case for all other selection schemes. We show that the new selection scheme can be much more effective than standard selection schemes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications · Metaheuristic Optimization Algorithms Research · Evolution and Genetic Dynamics
