The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm
From MaRDI portal
Publication:5060081
DOI10.18255/1818-1015-2020-4-488-508OpenAlexW3113396318MaRDI QIDQ5060081
M. V. Buzdalov, A. A. Shalyto, A. O. Bassin
Publication date: 17 January 2023
Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/mais730
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Derivative-free methods and methods using generalized derivatives (90C56)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
- From black-box complexity to designing new genetic algorithms
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
- Fast mutation in crossover-based algorithms
- Inducing finite state machines from training samples using ant colony optimization
- Comparing evolutionary algorithms to the (\(1+1\))-EA
- On non-elitist evolutionary algorithms optimizing fitness functions with a plateau
- Tuning an Algorithm Using Design of Experiments
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
- ParamILS: An Automatic Algorithm Configuration Framework
- Theory of Evolutionary Computation
This page was built for publication: The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm