GRAPE: Grammatical Algorithms in Python for Evolution

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

GRAPE is an implementation of Grammatical Evolution (GE) in DEAP, an Evolutionary Computation framework in Python, which consists of the necessary classes and functions to evolve a population of grammar-based solutions, while reporting essential measures. This tool was developed at the Bio-computing and Developmental Systems (BDS) Research Group, the birthplace of GE, as an easy to use (compared to the canonical C++ implementation, libGE) tool that inherits all the advantages of DEAP, such as selection methods, parallelism and multiple search techniques, all of which can be used with GRAPE. In this paper, we address some problems to exemplify the use of GRAPE and to perform a comparison with PonyGE2, an existing implementation of GE in Python. The results show that GRAPE has a similar performance, but is able to avail of all the extra facilities and functionality found in the DEAP framework. We further show that GRAPE enables GE to be applied to systems identification problems and we demonstrate this on two benchmark problems.

Author supplied keywords

Cite

CITATION STYLE

APA

de Lima, A., Carvalho, S., Dias, D. M., Naredo, E., Sullivan, J. P., & Ryan, C. (2022). GRAPE: Grammatical Algorithms in Python for Evolution. Signals, 3(3), 642–663. https://doi.org/10.3390/signals3030039

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free