On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation

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

Research output: Contribution to journalArticlepeer-review

14 Citations (SciVal)
147 Downloads (Pure)

Abstract

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 (SBM) 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 rigorously prove that by combining the advantages of k operators, several hybrid algorithmic schemes have optimal asymptotic performance on the easiest functions for each individual operator. In particular, the hybrid algorithms using CHM and SBM have optimal asymptotic performance on both OneMax and MinBlocks. We then investigate easiest functions for hybrid schemes and show that an easiest function for an hybrid algorithm is not just a trivial weighted combination of the respective easiest functions for each operator.
Original languageEnglish
Pages (from-to)714–740
JournalAlgorithmica
Volume78
Issue number2
Early online date18 Aug 2016
DOIs
Publication statusPublished - 01 Jun 2017

Keywords

  • running time anlysis
  • theory
  • hybridisation
  • evolutionary algorithms
  • artificial immune systems

Fingerprint

Dive into the research topics of 'On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation'. Together they form a unique fingerprint.

Cite this