The (1 + ( <i>λ,λ</i> )) GA is even faster on multimodal problems
Denis Antipov, Benjamin Doerr, Vitalii Karavaev
Abstract
For the (1 + (λ, λ)) genetic algorithm rigorous runtime analyses on unimodal fitness functions have shown that it can be faster than classical evolutionary algorithms, though on these simple problems the gains are only moderate.
Topics & Concepts
Simple (philosophy)Computer scienceGenetic algorithmEvolutionary algorithmMathematical optimizationAlgorithmTheoretical computer scienceArtificial intelligenceMathematicsMachine learningEpistemologyPhilosophyEvolutionary Algorithms and ApplicationsMetaheuristic Optimization Algorithms ResearchAdvanced Multi-Objective Optimization Algorithms