Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

In this paper we describe the genetic programming system GGP operating on graphs and introduce the notion of graph isomorphisms to explain how they influence the dynamics of GP. It is shown empirically how fitness databases can improve the performance of GP and how mapping graphs to a canonical form can increase these improvements by saving considerable evaluation time.
TidsskriftEvolutionary Computation
Udgave nummer2
Sider (fra-til)199-221
Antal sider23
StatusUdgivet - 2007
Eksternt udgivetJa

ID: 32645869