|InterJournal Complex Systems, 587
|Manuscript Number: |
Submission Date: 20625
|Invariant Subsets of the Search Space and Universality of a Generalized Genetic Algorithm|
Subject(s): CX.35, CX.66
Category: Brief Article
In this paper we shall give a mathematical description of a general evolutionary heuristic search algorithm which allows to see a very special property which slightly generalized genetic algorithms have comparing to other evolutionary computation techniques. It turns out that such a generalized genetic algorithm, which we call a binary semi-genetic algorithm, is capable of encoding virtually any other reasonable evolutionary heuristic search technique.
|Submit referee report/comment|