Managing Repetition in Grammar-Based Genetic Programming

Files in This Item:
File Description SizeFormat 
repeats2.pdf251.98 kBAdobe PDFDownload
Title: Managing Repetition in Grammar-Based Genetic Programming
Authors: Nicolau, Miguel
Fenton, Michael
Permanent link:
Date: 24-Jul-2016
Abstract: Grammar-based Genetic Programming systems are capable of generating identical phenotypic solutions, either by creating repeated genotypic representations, or from distinct genotypes, through their many-to-one mapping process. Furthermore, their initialisation process can generate a high number of duplicate individuals, while traditional variation and replacement operators can permit multiple individuals to percolate through generations unchanged. This can lead to a high number of phenotypically identical individuals within a population. This study investigates the frequency and effect of such duplicate individuals on a suite of benchmark problems. Both Grammatical Evolution and the CFG-GP systems are examined. Experimental evidence suggests that these useless evaluations can be instead be used either to speed-up the evolutionary process, or to delay convergence.
Funding Details: Science Foundation Ireland
Type of material: Conference Publication
Publisher: ACM
Copyright (published version): 2016 ACM
Keywords: Evolutionary algorithmsGenetic programming
DOI: 10.1145/2908812.2908904
Language: en
Status of Item: Peer reviewed
Is part of: Friedrich, T. (ed.). Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion
Conference Details: Genetic and Evolutionary Computation - GECCO 2016, Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20-24, 2016, Proceedings, July, 2016
Appears in Collections:Business Research Collection

Show full item record

Citations 50

Last Week
Last month
checked on Oct 11, 2018

Download(s) 50

checked on May 25, 2018

Google ScholarTM



This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.