On Performance Estimates for Two Evolutionary Algorithms

Authors:
Pavel A. Borisovsky;Anton V. Eremeev
Affiliations:
-;-
Venue:
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Year:
2001

Citing 7
Cited 0

Local search, reducibility and approximability of NP-optimization problems

Information Processing Letters
Randomized algorithms

Randomized algorithms
Hardness of approximations

Approximation algorithms for NP-hard problems
Finite Markov chain results in evolutionary computation: a tour d'horizon

Fundamenta Informaticae
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Modeling and Analysis of Genetic Algorithm with Tournament Selection

AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
An overview of evolutionary algorithms for parameter optimization

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the upper and lower bounds on probability to generate the solutions of sufficient quality using evolutionary strategies of two kinds: the (1+1)-ES and the (1,驴)-ES (see e.g. [1,2]). The results are obtained in terms of monotone bounds [3] on transition probabilities of the mutation operator. Particular attention is given to the computational complexity of mutation procedure for the NP-hard combinatorial optimization problems.