jGE: a Java implementation of grammatical evolution

  • Authors:
  • Loukas Georgiou;William J. Teahan

  • Affiliations:
  • School of Informatics, University of Wales, Bangor, U.K.;School of Informatics, University of Wales, Bangor, U.K.

  • Venue:
  • ICS'06 Proceedings of the 10th WSEAS international conference on Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Grammatical Evolution (GE) is a novel evolutionary algorithm which uses an arbitrary variable-length binary string to govern which production rule of a Backus Naur Form grammar will be used in a genotype-to-phenotype mapping process. This paper introduces the Java GE project (jGE), which is an implementation of GE in the Java language. The main difference between jGE and libGE, a public domain implementation of GE in C++, is that jGE incorporates the functionality of libGE as a component and provides implementation of the Search Engine as well as the Evaluator. The main idea behind the jGE Library (it can be downloaded at [16]) is to create a framework for evolutionary algorithms which can be extended to any specific implementation such as Genetic Algorithms, Genetic Programming and Grammatical Evolution.