Prosiectau fesul blwyddyn
Crynodeb
Mixed strategy evolutionary algorithms (EAs) aim at integrating several mutation operators into a single algorithm. However no analysis has been made to answer the theoretical question: whether and when is the performance of mixed strategy EAs better than that of pure strategy EAs? In this paper, asymptotic convergence rate and asymptotic hitting time are proposed to measure the performance of EAs. It is proven that the asymptotic convergence rate and asymptotic hitting time of any mixed strategy (1+1) EA consisting of several mutation operators is not worse than that of the worst pure strategy (1+1) EA using only one mutation operator. Furthermore it is proven that if these mutation operators are mutually complementary, then it is possible to design a mixed strategy (1+1) EA whose performance is better than that of any pure strategy (1+1) EA using only one mutation operator.
Iaith wreiddiol  Saesneg 

Teitl  Evolutionary Computation in Combinatorial Optimization 
Isdeitl  12th European Conference, EvoCOP 2012, Málaga, Spain, April 1113, 2012. Proceedings 
Golygyddion  JinKao Hao, Martin Middendorf 
Cyhoeddwr  Springer Nature 
Tudalennau  218229 
Cyfrol  7245 
ISBN (Electronig)  9783642291241 
ISBN (Argraffiad)  9783642291234, 3642291236 
Dynodwyr Gwrthrych Digidol (DOIs)  
Statws  Cyhoeddwyd  28 Maw 2012 
Cyfres gyhoeddiadau
Enw  Evolutionary Computation in Combinatorial Optimization 

Cyfrol  7245 
ISSN (Argraffiad)  03029743 
ISSN (Electronig)  16113349 
Ôl bys
Gweld gwybodaeth am bynciau ymchwil 'Pure Strategy or Mixed Strategy?'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.Prosiectau
 1 Wedi Gorffen

Evolutionary Approximation Algorithms for Optimization: Algorithm design and Complexity Analysis
He, J.
Engineering & Physical Sciences Research Council
01 Mai 2011 → 31 Hyd 2015
Prosiect: Ymchwil a ariannwyd yn allanol