National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Využití operátoru křížení v kartézském genetickém programování
Bromnik, Petr ; Sekanina, Lukáš (referee) ; Hurta, Martin (advisor)
The aim of this paper is to propose and implement two new crossover methods in Cartesian Genetic Programming (CGP) and compare them with existing approaches. CGP is a type of evolutionary algorithm that uses acyclic graphs to represent executable programs. Most CGP applications use the mutation operator only, but the effort to find a suitable crossover operator is still ongoing. In this paper, the two newly proposed crossover methods are compared on five symbolic regression problems against the standard 1 + lambda procedure based purely on mutation. Experimental results show that these methods find solutions in a similar number of fitness evaluations as 1 + lambda and, in two cases, even significantly earlier.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.