Prosiectau fesul blwyddyn
Crynodeb
Understanding which function classes are easy and which are hard for a given algorithm is a fundamental question for the analysis and design of bioinspired search heuristics. A natural starting point is to consider the easiest and hardest functions for an algorithm. For the (1+1) EA using standard bit mutation it is well known that OneMax is an easiest function with unique optimum while Trap is a hardest.
In this paper we extend the analysis of easiest function classes to the contiguous somatic hypermutation (CHM) operator used in artificial immune systems. We define a function MinBlocks and prove that it is an easiest function for the (1+1) EA using CHM, presenting both a runtime and a fixed budget analysis. Since MinBlocks is, up to a factor of 2, a hardest function for standard bit mutations, we consider the effects of combining both operators into a hybrid algorithm. We show that an easiest function for the hybrid algorithm is not just a trivial weighted combination of the respective easiest functions for each operator. Nevertheless, by combining the advantages of both operators, the hybrid algorithm has optimal asymptotic performance on both OneMax and MinBlocks.
In this paper we extend the analysis of easiest function classes to the contiguous somatic hypermutation (CHM) operator used in artificial immune systems. We define a function MinBlocks and prove that it is an easiest function for the (1+1) EA using CHM, presenting both a runtime and a fixed budget analysis. Since MinBlocks is, up to a factor of 2, a hardest function for standard bit mutations, we consider the effects of combining both operators into a hybrid algorithm. We show that an easiest function for the hybrid algorithm is not just a trivial weighted combination of the respective easiest functions for each operator. Nevertheless, by combining the advantages of both operators, the hybrid algorithm has optimal asymptotic performance on both OneMax and MinBlocks.
Iaith wreiddiol  Saesneg 

Teitl  Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015) 
Man cyhoeddi  New York 
Cyhoeddwr  Association for Computing Machinery 
Tudalennau  13991406 
ISBN (Argraffiad)  9781450334723 
Statws  Cyhoeddwyd  2015 
Ôl bys
Gweld gwybodaeth am bynciau ymchwil 'On easiest functions for somatic contiguous hypermutations and standard bit mutations'. 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