Leap Mapping: Improving Grammatical Evolution for Modularity Problems
Created by W.Langdon from
gp-bibliography.bib Revision:1.7975
- @InProceedings{de-lima:2023:GECCOcomp,
-
author = "Allan {De Lima} and Samuel Carvalho and
Douglas Dias and Joseph Sullivan and Conor Ryan",
-
title = "Leap Mapping: Improving Grammatical Evolution for
Modularity Problems",
-
booktitle = "Proceedings of the 2023 Genetic and Evolutionary
Computation Conference",
-
year = "2023",
-
editor = "Sara Silva and Luis Paquete and Leonardo Vanneschi and
Nuno Lourenco and Ales Zamuda and Ahmed Kheiri and
Arnaud Liefooghe and Bing Xue and Ying Bi and
Nelishia Pillay and Irene Moser and Arthur Guijt and
Jessica Catarino and Pablo Garcia-Sanchez and
Leonardo Trujillo and Carla Silva and Nadarajen Veerapen",
-
pages = "555--558",
-
address = "Lisbon, Portugal",
-
series = "GECCO '23",
-
month = "15-19 " # jul,
-
organisation = "SIGEVO",
-
publisher = "Association for Computing Machinery",
-
publisher_address = "New York, NY, USA",
-
keywords = "genetic algorithms, genetic programming, grammatical
evolution, mapping, introns: Poster",
-
isbn13 = "9798400701191",
-
DOI = "doi:10.1145/3583133.3590680",
-
size = "4 pages",
-
abstract = "We introduce Leap mapping, a new mapping process for
Grammatical Evolution (GE), which spreads introns
within the effective length of the genome (the part of
the genome consumed while mapping), preserving
information for future generations and performing less
disruptive crossover and mutation operations than
standard GE. Using the exact same genotypic
representation as GE, Leap mapping reads the genome in
separate parts named 'frames', where the size of each
is the number of production rules in the grammar. Each
codon inside a frame is responsible for mapping a
different production rule of the grammar. The process
keeps consuming codons from the frame until it needs to
map again a production rule already mapped with that
frame. At this point, the mapping starts consuming
codons from the next frame. We assessed the performance
of this new mapping in some benchmark problems, which
require modular solutions: four Boolean problems and
three versions of the Lawnmower problem. Moreover, we
compared the results with the standard mapping
procedure and a multi-genome version.",
-
notes = "GECCO-2023 A Recombination of the 32nd International
Conference on Genetic Algorithms (ICGA) and the 28th
Annual Genetic Programming Conference (GP)",
- }
Genetic Programming entries for
Allan De Lima
Samuel Carvalho
Douglas Mota Dias
Joe Sullivan
Conor Ryan
Citations