Skip to main content

1996 | ReviewPaper | Buchkapitel

Intelligent mutation rate control in canonical genetic algorithms

verfasst von : Thomas Bäck, Martin Schütz

Erschienen in: Foundations of Intelligent Systems

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

The role of the mutation rate in canonical genetic algorithms is investigated by comparing a constant setting, a deterministically varying, time-dependent mutation rate schedule, and a self-adaptation mechanism for individual mutation rates following the principle of self-adaptation as used in evolution strategies. The power of the self-adaptation mechanism is illustrated by a time-varying optimization problem, where mutation rates have to adapt continuously in order to follow the optimum. The strengths of the proposed deterministic schedule and the self-adaptation method are demonstrated by a comparison of their performance on difficult combinatorial optimization problems (multiple knapsack, maximum cut and maximum independent set in graphs). Both methods are shown to perform significantly better than the canonical genetic algorithm, and the deterministic schedule yields the best results of all control mechanisms compared.

Metadaten
Titel
Intelligent mutation rate control in canonical genetic algorithms
verfasst von
Thomas Bäck
Martin Schütz
Copyright-Jahr
1996
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-61286-6_141