Fractal Dimension of Trajectory as Invariant of Genetic Algorithms
Date
2008
Authors
Kotowski, S.
Kosinski, W.
Michalewicz, Z.
Nowicki, J.
Przepiorkiewicz, B.
Editors
Rutkowski, L.
Tadeusiewicz, R.
Zadeh, L.A.
Zurada, J.M.
Tadeusiewicz, R.
Zadeh, L.A.
Zurada, J.M.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Artificial intelligence and soft computing - ICAISC 2008 : 9th international conference, Zakopane, Poland, June 22-26, 2008 : proceedings / L. Rutkowski ... [et al.] (eds.): pp.414-425
Statement of Responsibility
Stefan Kotowski, Witold Kosiński, Zbigniew Michalewicz, Jakub Nowicki, and Bartosz Przepiórkiewicz
Conference Name
ICAISC (9th : 2008 : Zakopane, Poland)
Abstract
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. © 2008 Springer-Verlag Berlin Heidelberg.