Title
Evolutionary multiobjective optimization algorithm as a Markov system
Abstract
In the paper we consider the ranking given by the Pareto dominance relation as a basis to create a selection operator for the Evolutionary Multiobjective Optimization Algorithm (EMOA). Assuming that sampling to the next epoch is performed according to the generalized Bernoulli schema with regard to a selected type of the rank selection, a heuristic operator for EMOA is introduced. Having defined the heuristic operator, the transition probability matrix of the uniform Markov chain modeling EMOA can be explicitly obtained as in the Vose's theory of the Simple Genetic Algorithm (SGA). This chain is ergodic if the mixing operator following the EMOA selection operator in each epoch is strictly positive. Moreover, we show that the measure on the space of populations imposed by the EMOA infinite population concentrates on the set of fixed points of the heuristic operator after infinite number of epochs, assuming that the heuristic operator is focusing.
Year
DOI
Venue
2010
10.1007/978-3-642-15844-5_62
PPSN (1)
Keywords
Field
DocType
selection operator,next epoch,simple genetic algorithm,uniform markov chain,emoa infinite population,rank selection,evolutionary multiobjective optimization algorithm,emoa selection operator,infinite number,markov system,heuristic operator,fixed point,evolutionary algorithm,multi objective optimization,markov chain model
Population,Mathematical optimization,Heuristic,Evolutionary algorithm,Stochastic matrix,Computer science,Markov chain,Multi-objective optimization,Operator (computer programming),Artificial intelligence,Machine learning,Genetic algorithm
Conference
Volume
ISSN
ISBN
6238
0302-9743
3-642-15843-9
Citations 
PageRank 
References 
3
0.41
8
Authors
3
Name
Order
Citations
PageRank
Ewa Gajda1294.03
Robert Schaefer210110.99
Maciej Smołka310713.60