Abstract
In this paper we investigate the impact of the Permutation Problem on a standard Genetic Algorithm evolving neural networks for a difficult control problem. Through the use of Price's equation and an explicit enumeration of permutations within the population we demonstrate that for the given problem and representation the Permutation Problem is not as serious a concern as previously thought. In addition we present the concept of incompatible representations as a more useful guide for what to avoid in the evolution of neural networks. Copyright 2009 ACM.
Original language | English |
---|---|
Title of host publication | Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009|Proc. Annu. Genetic Evol. Comput. Conf., GECCO |
Publisher | Association for Computing Machinery |
Pages | 787-794 |
Number of pages | 7 |
ISBN (Print) | 9781605583259 |
DOIs | |
Publication status | Published - 2009 |
Event | 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 - Montreal, QC Duration: 1 Jul 2009 → … http://dblp.uni-trier.de/db/conf/gecco/gecco2009.html#HaflidasonN09http://dblp.uni-trier.de/rec/bibtex/conf/gecco/HaflidasonN09.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/gecco/HaflidasonN09 |
Conference
Conference | 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 |
---|---|
City | Montreal, QC |
Period | 1/07/09 → … |
Internet address |
Keywords
- Genetic algorithms
- Neural networks
- Permutation problem