Rule-based graph programming is a deep and rich topic. We present an approach to exploiting the power of graph programming as a representation and as an execution medium in an evolutionary algorithm (EGGP). We demonstrate this power in comparison with Cartesian Genetic Programming (CGP), showing that it is significantly more efficient in terms of fitness evaluations on some classic benchmark problems. We hypothesise that this is due to its ability to exploit the full graph structure, leading to a richer mutation set, and outline future work to test this hypothesis, and to exploit further the power of graph programming within an EA.
full paper | doi:10.1007/978-3-319-77553-1_3
@inproceedings(Atkinson++:2018:EuroGP, author = "Timothy Atkinson and Detlef Plump and Susan Stepney", title = "Evolving Graphs by Graph Programming", pages = "35-51", doi = "10.1007/978-3-319-77553-1_3", crossref = "EuroGP:2018" ) @proceedings(EuroGP:2018, title = "EuroGP 2018, Parma, Italy, April 2018", booktitle = "EuroGP 2018, Parma, Italy, April 2018", series = "LNCS", volume = 10781, publisher = "Springer", year = 2018 )