2008 | OriginalPaper | Buchkapitel
Fractal Dimension of Trajectory as Invariant of Genetic Algorithms
verfasst von : Stefan Kotowski, Witold Kosiński, Zbigniew Michalewicz, Jakub Nowicki, Bartosz Przepiórkiewicz
Erschienen in: Artificial Intelligence and Soft Computing – ICAISC 2008
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Convergence properties of genetic algorithms are investigated. For them some measures are introduced. A classification procedure is proposed for genetic algorithms based on a conjecture: the entropy and the fractal dimension of trajectories produced by them are quantities that characterize the classes of the algorithms. The role of these quantities as invariants of the algorithm classes is presented. The present approach can form a new method in construction and adaptation of genetic algorithms and their optimization based on dynamical systems theory.