IDA - Intelligent Data Analysis Research Group

BibTeX Entry

@inproceedings{kubalik03,
  category = {ida-publications},
  author = {Jiri Kubalik and Jan Koutnik and Leon J. M. Rothkrantz},
  title = {Grammatical Evolution with Bidirectional Representation},
  booktitle = {Genetic Programming, Proceedings of EuroGP'2003},
  editor = {Conor Ryan and Terence Soule and Maarten Keijzer and Edward Tsang and Riccardo Poli and Ernesto Costa},
  series = {LNCS},
  volume = {2610},
  year = {2003},
  publisher = {Springer-Verlag},
  address = {Essex},
  pages = {354--363},
  month = {14-16 April},
  keywords = {genetic algorithms, genetic programming, grammatical evolution},
  abstract = {Grammatical evolution is an evolutionary algorithm designed to evolve programs in any language. Grammatical evolution operates on binary strings and the mapping of the genotype onto the phenotype (the tree representation of the programs) is provided through the grammar described in the form of production rules. The program trees are constructed in a pre-order fashion, which means that as the genome is traversed first the left most branch of the tree is completed then the second from the left one etc. Once two individuals are crossed over by means of simple one-point crossover the tail parts of the chromosomes (originally encoding the structures on the right side of the program tree) may map on different program structures within the new context. Here we present a bidirectional representation which helps to equalize the survival rate of both the program structures appearing on the left and right side of the program parse tree.},
  vvvs = {1},
}


Creative Commons License  Content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Czech Republic License.