Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms

The fitness level method is a popular tool for analyzing the hitting time of elitist evolutionary algorithms. Its idea is to divide the search space into multiple fitness levels and estimate lower and upper bounds on the hitting time using transition probabilities between fitness levels. However, th...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Evolutionary computation Ročník 33; číslo 1; s. 1
Hlavní autori: He, Jun, Zhou, Yuren
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: United States 15.03.2025
Predmet:
Algorithms
Biological Evolution
Computer Simulation
Genetic Fitness
Models, Genetic
Probability
Markov chain
fitness levels
algorithm analysis
hitting time
Evolutionary algorithm
drift analysis
ISSN:1530-9304, 1530-9304
On-line prístup:Zistit podrobnosti o prístupe
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The fitness level method is a popular tool for analyzing the hitting time of elitist evolutionary algorithms. Its idea is to divide the search space into multiple fitness levels and estimate lower and upper bounds on the hitting time using transition probabilities between fitness levels. However, the lower bound generated by this method is often loose. An open question regarding the fitness level method is what are the tightest lower and upper time bounds that can be constructed based on transition probabilities between fitness levels. To answer this question, we combine drift analysis with fitness levels and define the tightest bound problem as a constrained multiobjective optimization problem subject to fitness levels. The tightest metric bounds by fitness levels are constructed and proven for the first time. Then linear bounds are derived from metric bounds and a framework is established that can be used to develop different fitness level methods for different types of linear bounds. The framework is generic and promising, as it can be used to draw tight time bounds on both fitness landscapes with and without shortcuts. This is demonstrated in the example of the (1+1) EA maximizing the TwoMax1 function.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1530-9304
1530-9304
DOI:10.1162/evco_a_00349