Wróblewski J., 1996. Theoretical Foundations of Order-Based Genetic Algorithms. Fundamenta Informaticae, vol. 28 (3, 4), pp: 423-430. IOS Press, 1996.
ABSTRACT
A lot of research on genetic algorithms theory is concentrated on classical, binary case. However, there are many other types of useful genetic algorithms (GA), e.g. tree-based (genetic programming), or order-based ones. This paper shows, that many of classical results can be transferred into the order-based GAs. The analysis includes the Schema Theorem and Markov chain modelling of order-based GA.