Local selection
Local selection (LS) is a very simple selection scheme in evolutionary algorithms. Individual fitnesses are compared to a fixed threshold, rather than to each other, to decide who gets to reproduce. LS, coupled with fitness functions stemming from the consumption of shared environmental resources, m...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Local selection (LS) is a very simple selection scheme in evolutionary algorithms. Individual fitnesses are compared to a fixed threshold, rather than to each other, to decide who gets to reproduce. LS, coupled with fitness functions stemming from the consumption of shared environmental resources, maintains diversity in a way similar to fitness sharing; however it is generally more efficient than fitness sharing, and lends itself to parallel implementations for distributed tasks. While LS is not prone to premature convergence, it applies minimal selection pressure upon the population. LS is therefore more appropriate than other, stronger selection schemes only on certain problem classes. This papers characterizes one broad class of problems in which LS consistently out-performs tournament selection. |
---|---|
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/BFb0040821 |