Automatic Adaptation of Hypermutation Rates for Multimodal Optimisation
Loading...
Files
Date
2021
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Assoc Computing Machinery
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Previous work has shown that in Artificial Immune Systems (AIS) the best static mutation rates to escape local optima with the ageing operator are far from the optimal ones to do so via large hypermutations and vice-versa. In this paper we propose an AIS that automatically adapts the mutation rate during the run to make good use of both operators. We perform rigorous time complexity analyses for standard multimodal benchmark functions with significant characteristics and prove that our proposed algorithm can learn to adapt the mutation rate appropriately such that both ageing and hypermutation are effective when they are most useful for escaping local optima. In particular, the algorithm provably adapts the mutation rate such that it is efficient for the problems where either operator has been proven to be effective in the literature.
Description
16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA) -- SEP 06-08, 2021 -- Vorarlberg Univ Appl Sci, ELECTR NETWORK
Keywords
Genetic Algorithms, Search, randomized search heuristics, artificial immune systems, evolutionary algorithms, Approximations, hypermutations, ageing, Genetic Algorithms, multimodal optimization, Search, parameter adaptation, Approximations, runtime analysis
Turkish CoHE Thesis Center URL
Fields of Science
Citation
9
WoS Q
N/A
Scopus Q
N/A
Source
Proceedings of The 16th Acm/Sigevo Conference on Foundations of Genetic Algorithms (Foga'21)