You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Theoretical Foundations of Order-Based Genetic Algorithms

Article type: Research Article

Authors: Wróblewski, Jakub

Affiliations: Institute of Mathematics, Warsaw University, Warsaw, Poland. jakubw@alfa.mimuw.edu.pl

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.

DOI: 10.3233/FI-1996-283414

Journal: Fundamenta Informaticae, vol. 28, no. 3-4, pp. 423-430, 1996

Published: 1996
Price: EUR 27.50
Show more