The “One-Fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ, λ)) Genetic Algorithm

Self-adjustment of parameters can significantly improve the performance of evolutionary algorithms. A notable example is the (1 + (λ, λ)) genetic algorithm, where adaptation of the population size helps to achieve the linear running time on the OneMax problem. However, on problems which interfere wi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Automatic control and computer sciences Ročník 55; číslo 7; s. 885 - 902
Hlavní autoři: Bassin, A. O., Buzdalov, M. V., Shalyto, A. A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.12.2021
Springer Nature B.V
Témata:
ISSN:0146-4116, 1558-108X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Self-adjustment of parameters can significantly improve the performance of evolutionary algorithms. A notable example is the (1 + (λ, λ)) genetic algorithm, where adaptation of the population size helps to achieve the linear running time on the OneMax problem. However, on problems which interfere with the assumptions behind the self-adjustment procedure, its usage can lead to the performance degradation. In particular, this is the case with the “one-fifth rule” on problems with weak fitness-distance correlation. We propose a modification of the “one-fifth rule” in order to have less negative impact on the performance in the cases where the original rule is destructive. Our modification, while still yielding a provable linear runtime on OneMax, shows better results on linear functions with random weights, as well as on random satisfiable MAX-3SAT problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0146-4116
1558-108X
DOI:10.3103/S0146411621070208