Our publications

Genetic algorithms

Author
LIWIUSZ SZCZEPAŃSKI, ADRIAN SOBKOWSKI, TOMASZ KAŁACZYŃSKI
Keywords
genetic algorithms, evolution strategies, genetic programming, evolutionary programming,
search, automated programming, parallel algorithms
Abstract

Many methods to optimize our operations rely on careful movement from point to point in a certain decision area in accordance with the selection rule specifying the next step. However, it is not safe because there is a possibility of stepping on a "false" (no global) maximum in multimodal (containing many vertices) space exploration. In contrast, genetic algorithms work at the same time on rich base points (the population of coded strings), climbing at the same time on many vertices; thus, the chance of getting stuck on a local tip is much smaller.

Pobierz artykuł
PDF