Çörüş, DoğanCorus, DoganOliveto, Pietro S.Yazdani, Donya2023-10-192023-10-1920219978-1-4503-8352-3https://doi.org/10.1145/3450218.3477305https://hdl.handle.net/20.500.12469/508616th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA) -- SEP 06-08, 2021 -- Vorarlberg Univ Appl Sci, ELECTR NETWORKPrevious 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.eninfo:eu-repo/semantics/openAccessGenetic AlgorithmsSearchrandomized search heuristicsartificial immune systemsevolutionary algorithmsApproximationshypermutationsageingGenetic Algorithmsmultimodal optimizationSearchparameter adaptationApproximationsruntime analysisConference ObjectWOS:00074891030000410.1145/3450218.34773052-s2.0-85114941882N/AN/A