Theoretical Foundations of Order-Based Genetic Algorithms

Authors:
Jakub Wróblewski
Affiliations:
Institute of Mathematics, Warsaw University, Warsaw, Poland. jakubw@alfa.mimuw.edu.pl
Venue:
Fundamenta Informaticae
Year:
1996

Citing 4
Cited 1

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Markov Chain Analysis on A Genetic Algorithm

Proceedings of the 5th International Conference on Genetic Algorithms

Adaptive generalized crowding for genetic algorithms

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.