Fast Artificial Immune Systems

06/01/2018
by   Dogan Corus, et al.
0

Various studies have shown that characteristic Artificial Immune System (AIS) operators such as hypermutations and ageing can be very efficient at escaping local optima of multimodal optimisation problems. However, this efficiency comes at the expense of considerably slower runtimes during the exploitation phase compared to standard evolutionary algorithms. We propose modifications to the traditional `hypermutations with mutation potential' (HMP) that allow them to be efficient at exploitation as well as maintaining their effective explorative characteristics. Rather than deterministically evaluating fitness after each bitflip of a hypermutation, we sample the fitness function stochastically with a `parabolic' distribution which allows the `stop at first constructive mutation' (FCM) variant of HMP to reduce the linear amount of wasted function evaluations when no improvement is found to a constant. By returning the best sampled solution during the hypermutation, rather than the first constructive mutation, we then turn the extremely inefficient HMP operator without FCM, into a very effective operator for the standard Opt-IA AIS using hypermutation, cloning and ageing. We rigorously prove the effectiveness of the two proposed operators by analysing them on all problems where the performance of HPM is rigorously understood in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2020

Fast Immune System Inspired Hypermutation Operators for Combinatorial Optimisation

Various studies have shown that immune system inspired hypermutation ope...
research
03/27/2019

On Inversely Proportional Hypermutations with Mutation Potential

Artificial Immune Systems (AIS) employing hypermutations with linear sta...
research
04/04/2018

When Hypermutations and Ageing Enable Artificial Immune Systems to Outperform Evolutionary Algorithms

We present a time complexity analysis of the Opt-IA artificial immune sy...
research
05/28/2018

Randomized Local Search Heuristics for Submodular Maximization and Covering Problems: Benefits of Heavy-tailed Mutation Operators

A core feature of evolutionary algorithms is their mutation operator. Re...
research
06/01/2018

Artificial Immune Systems Can Find Arbitrarily Good Approximations for the NP-Hard Partition Problem

Typical Artificial Immune System (AIS) operators such as hypermutations ...
research
10/16/2009

An Evolutionary Squeaky Wheel Optimisation Approach to Personnel Scheduling

The quest for robust heuristics that are able to solve more than one pro...
research
05/18/2004

Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms

This paper presents two different efficiency-enhancement techniques for ...

Please sign up or login with your details

Forgot password? Click here to reset