Cited By
View all- Medvet ENadizar GManzoni LWagner M(2022)JGEAProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3520304.3533960(2009-2018)Online publication date: 9-Jul-2022
Exploring the application of GOMEA to bit-string GE
Pages 270 - 271
Abstract
We explore the application of GOMEA, a recent method for discovering and exploiting the model for a problem in the form of linkage, to Grammatical Evolution (GE). GE employs an indirect representation based on familiar bit-string genotypes and is applicable to any problem where the solutions may be described using a context-free grammar, which hence greatly favors its wide adoption. Being general purpose, the representation of GE raises the opportunity for benefiting from the potential of GOMEA to automatically discover and exploit the linkage. We analyze experimentally the application of GOMEA to two bit-string-based variants of GE representation (the original representation and the recent WHGE) and show that GOMEA is clearly beneficial when coupled to WHGE, whereas it delivers no significant advantages when coupled with GE.
References
[1]
Anton Bouter, Tanja Alderliesten, Cees Witteveen, and Peter AN Bosman. 2017. Exploiting linkage information in real-valued optimization with the real-valued gene-pool optimal mixing evolutionary algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference. ACM, 705--712.
[2]
Pei He, Zelin Deng, Chongzhi Gao, Liang Chang, and Achun Hu. 2017. Analyzing Grammatical Evolution and πGrammatical Evolution with Grammar Model. In Information Technology and Intelligent Transportation Systems. Springer, 483--489.
[3]
Eric Medvet. 2017. A Comparative Analysis of Dynamic Locality and Redundancy in Grammatical Evolution. In European Conference on Genetic Programming. Springer, 326--342.
[4]
Eric Medvet. 2017. Hierarchical Grammatical Evolution. In Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '17). ACM, New York, NY, USA, 249--250.
[5]
Michael O'Neill and Conor Ryan. 2004. Grammatical evolution by grammatical evolution: The evolution of grammar and genetic code. Genetic Programming (2004), 138--149.
[6]
Conor Ryan, JJ Collins, and Michael O'Neill. 1998. Grammatical evolution: Evolving programs for an arbitrary language. In European Conference on Genetic Programming. Springer, 83--96.
[7]
Dirk Thierens and Peter A.N. Bosman. 2011. Optimal Mixing Evolutionary Algorithms. In Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation (GECCO '11). ACM, New York, NY, USA, 617--624.
[8]
Ann Thorhauer. 2016. On the Non-uniform Redundancy in Grammatical Evolution. In International Conference on Parallel Problem Solving from Nature. Springer, 292--302.
[9]
Marco Virgolin, Tanja Alderliesten, Cees Witteveen, and Peter A N Bosman. 2017. Scalable genetic programming by gene-pool optimal mixing and input-space entropy-based building-block learning. In Proceedings of the Genetic and Evolutionary Computation Conference. ACM, 1041--1048.
[10]
Pak-Kan Wong, Man-Leung Wong, and Kwong-Sak Leung. 2016. Hierarchical Knowledge in Self-Improving Grammar-Based Genetic Programming. In International Conference on Parallel Problem Solving from Nature. Springer, 270--280.
Index Terms
- Exploring the application of GOMEA to bit-string GE
Recommendations
Genotype representations in grammatical evolution
Grammatical evolution (GE) is a form of grammar-based genetic programming. A particular feature of GE is that it adopts a distinction between the genotype and phenotype similar to that which exists in nature by using a grammar to map between the ...
Elementary bit string mutation landscapes
FOGA '11: Proceedings of the 11th workshop proceedings on Foundations of genetic algorithmsGenetic Programming parity with only XOR is not elementary. GP parity can be represented as the sum of k/2+1 elementary landscapes. Statistics, including fitness distance correlation (FDC), of Parity's fitness landscape are calculated. Using Walsh ...
On the mapping of genotype to phenotype in evolutionary algorithms
Analogies with molecular biology are frequently used to guide the development of artificial evolutionary search. A number of assumptions are made in using such reasoning, chief among these is that evolution in natural systems is an optimal, or at least ...
Comments
Information & Contributors
Information
Published In
July 2018
1968 pages
Copyright © 2018 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 July 2018
Check for updates
Author Tags
Qualifiers
- Poster
Conference
GECCO '18
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 51Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Medvet ENadizar GManzoni LWagner M(2022)JGEAProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3520304.3533960(2009-2018)Online publication date: 9-Jul-2022
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in