Search Results for author:
Found 6 papers, 0 papers with code
On Non-Elitist Evolutionary Algorithms Optimizing Fitness Functions with a Plateau
We consider the expected runtime of non-elitist evolutionary algorithms (EAs), when they are applied to a family of fitness functions with a plateau of second-best fitness in a Hamming ball of radius r around a unique global optimum.
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum
A computational experiment is carried out, where the proposed algorithm is compared to COINBONMIN solver, applied to a mixed integer quadratic programming formulation of the problem.
Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization
The paper is devoted to upper bounds on run-time of Non-Elitist Genetic Algorithms until some target subset of solutions is visited for the first time.
Evolutionary algorithms
This manuscript contains an outline of lectures course "Evolutionary Algorithms" read by the author.
Level-based Analysis of Genetic Algorithms and other Search Processes
Finally, we prove that the theorem is nearly optimal for the processes considered.
Optimal Recombination in Genetic Algorithms
This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions.
