On easiest functions for somatic contiguous hypermutations and standard bit mutations

Dogan Corus, Jun He, Thomas Jansen, Pietro Oliveto, Dirk Sudholt, Christine Zarges

Research output: Chapter in Book/Report/Conference proceedingConference Proceeding (Non-Journal item)

7 Citations (SciVal)


Understanding which function classes are easy and which are hard for a given algorithm is a fundamental question for the analysis and design of bio-inspired 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.
Original languageEnglish
Title of host publicationProceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015)
Place of PublicationNew York
PublisherAssociation for Computing Machinery
ISBN (Print)978-1-4503-3472-3
Publication statusPublished - 2015


Dive into the research topics of 'On easiest functions for somatic contiguous hypermutations and standard bit mutations'. Together they form a unique fingerprint.

Cite this