Fast mutation in crossover-based algorithms
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Abstract
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 successfully used only in purely mutation-based algorithms. There, it can relieve the algorithm designer from finding the optimal mutation rate and nevertheless obtain a performance close to the one that the optimal mutation rate gives.
Topics & Concepts
CrossoverMutationMutation rateAlgorithmOperator (biology)Computer scienceAdaptive mutationMathematicsMathematical optimizationGenetic algorithmArtificial intelligenceGeneticsBiologyRepressorGeneTranscription factorMetaheuristic Optimization Algorithms ResearchAdvanced Multi-Objective Optimization AlgorithmsScheduling and Timetabling Solutions