publication . Conference object . 2004

Experiments with explicit for-loops in genetic programming

V. Ciesielski; null Xiang Li;
Open Access
  • Published: 28 Sep 2004
  • Publisher: IEEE
Abstract
Evolving programs with explicit loops presents major difficulties, primarily due to the massive increase in the size of the search space. Fitness evaluation becomes computationally expensive and a method for dealing with infinite loops must be implemented. We have investigated ways of dealing with these problems by the evolution of for-loops of increasing semantic complexity. We have chosen two problems - a modified Santa Fe ant problem and a sorting problem - which have natural looping constructs in their solution and a solution without loops is not possible unless the tree depth is very large. We have shown that by controlling the complexity of the loop struct...
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue