An Induction-Based Control for Genetic Algorithms (Extended Abstract)
Abstract
This paper presents an induction-based control of genetic algorithms: 1- examples of the behavior of the genetic operators (crossover and mutation) are gathered; 2- rules characterizing disruptive operators are induced from the gathered examples; 3- last, these rules are used to reject operators classified disruptive. Evolution is thereby speeded up. Experimental results on the well-known Royal Road problem and on a GA-deceptive problem are presented.
Cite
Text
Sebag et al. "An Induction-Based Control for Genetic Algorithms (Extended Abstract)." European Conference on Machine Learning, 1995. doi:10.1007/3-540-59286-5_85Markdown
[Sebag et al. "An Induction-Based Control for Genetic Algorithms (Extended Abstract)." European Conference on Machine Learning, 1995.](https://mlanthology.org/ecmlpkdd/1995/sebag1995ecml-inductionbased/) doi:10.1007/3-540-59286-5_85BibTeX
@inproceedings{sebag1995ecml-inductionbased,
title = {{An Induction-Based Control for Genetic Algorithms (Extended Abstract)}},
author = {Sebag, Michèle and Schoenauer, Marc and Ravise, Caroline},
booktitle = {European Conference on Machine Learning},
year = {1995},
pages = {351-355},
doi = {10.1007/3-540-59286-5_85},
url = {https://mlanthology.org/ecmlpkdd/1995/sebag1995ecml-inductionbased/}
}