Self-adjusting population sizes for the (1,λ)-EA on monotone functions

Self-adjusting population sizes for the (1,λ)-EA on monotone functions

We study the (1,λ)-EA with mutation rate c/n for c≤1, where the population size is adaptively controlled with the (1:s+1)-success rule. Recently, Hevia Fajardo and Sudholt have shown that this setup with c=1 is efficient on OneMax for s

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science 2023-11, Vol.979, p.114181, Article 114181
Hauptverfasser: Kaufmann, Marc, Larcher, Maxime, Lengler, Johannes, Zou, Xun
Format: Artikel
Sprache:eng
Schlagworte:
[formula omitted]-EA
Dynamic environments
Evolutionary algorithm
Monotone functions
One-fifth rule
Parameter control
Self-adaptation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the (1,λ)-EA with mutation rate c/n for c≤1, where the population size is adaptively controlled with the (1:s+1)-success rule. Recently, Hevia Fajardo and Sudholt have shown that this setup with c=1 is efficient on OneMax for s
ISSN:0304-3975
DOI:10.1016/j.tcs.2023.114181