Fast Mutation in Crossover-Based Algorithms

The heavy-tailed mutation operator proposed in Doerr et al. (GECCO 2017), called fast mutation to agree with the previously used language, so far was proven to be advantageous only in mutation-based algorithms. There, it can relieve the algorithm designer from finding the optimal mutation rate and n...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 84; číslo 6; s. 1724 - 1761
Hlavní autoři:	Antipov, Denis, Buzdalov, Maxim, Doerr, Benjamin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2022 Springer Nature B.V
Témata:	2020 Algorithm Analysis and Problem Complexity Algorithms Asymptotic properties Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Empirical analysis Genetic algorithms Mathematics of Computing Mutation Optimization Special Issue on Genetic and Evolutionary Computation Theory of Computation
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!