Hitting Times of Local and Global Optima in Genetic Algorithms With Very High Selection Pressure
Yugoslav journal of operations research, Tome 27 (2017) no. 3, p. 323
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
The paper is devoted to upper bounds on the expected first hitting times
of the sets of local or global optima for non-elitist genetic algorithms with very high
selection pressure. The results of this paper extend the range of situations where
the upper bounds on the expected runtime are known for genetic algorithms and
apply, in particular, to the Canonical Genetic Algorithm. The obtained bounds
do not require the probability of fitness-decreasing mutation to be bounded by a
constant which is less than one.
Classification :
90C59, 90C10
Keywords: Combinatorial Optimization, Evolutionary Algorithms, Runtime Analysis, Fitness Level, Local Search
Keywords: Combinatorial Optimization, Evolutionary Algorithms, Runtime Analysis, Fitness Level, Local Search
@article{YJOR_2017_27_3_a3,
author = {Anton V. Eremeev},
title = {Hitting {Times} of {Local} and {Global} {Optima} in {Genetic} {Algorithms} {With} {Very} {High} {Selection} {Pressure}},
journal = {Yugoslav journal of operations research},
pages = {323 },
year = {2017},
volume = {27},
number = {3},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2017_27_3_a3/}
}
TY - JOUR AU - Anton V. Eremeev TI - Hitting Times of Local and Global Optima in Genetic Algorithms With Very High Selection Pressure JO - Yugoslav journal of operations research PY - 2017 SP - 323 VL - 27 IS - 3 UR - http://geodesic.mathdoc.fr/item/YJOR_2017_27_3_a3/ LA - en ID - YJOR_2017_27_3_a3 ER -
Anton V. Eremeev. Hitting Times of Local and Global Optima in Genetic Algorithms With Very High Selection Pressure. Yugoslav journal of operations research, Tome 27 (2017) no. 3, p. 323 . http://geodesic.mathdoc.fr/item/YJOR_2017_27_3_a3/