NENov 22, 2015

Evolutionary algorithms

arXiv:1511.06987v54 citations
Originality Synthesis-oriented
AI Analysis

This is an incremental educational resource for students or researchers learning about evolutionary algorithms, presented in Russian.

The manuscript outlines a lecture course on evolutionary algorithms, covering various genetic algorithms, evolutionary strategies, and related topics, with proofs provided for key facts such as the Schemata Theorem and convergence properties.

This manuscript contains an outline of lectures course "Evolutionary Algorithms" read by the author. The course covers Canonic Genetic Algorithm and various other genetic algorithms as well as evolutionary strategies, genetic programming, tabu search and the class of evolutionary algorithms in general. Some facts, such as the Rotation Property of crossover, the Schemata Theorem, GA performance as a local search and "almost surely" convergence of evolutionary algorithms are given with complete proofs. The text is in Russian.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes