Cartesian Genetic Programming: Why No Bloat?
نویسندگان
چکیده
For many years now it has been known that Cartesian Genetic Programming (CGP) does not exhibit program bloat. Two possible explanations have been proposed in the literature: neutral genetic drift and length bias. This paper empirically disproves both of these and thus, reopens the question as to why CGP does not suffer from bloat. It has also been shown for CGP that using a very large number of nodes considerably increases the effectiveness of the search. This paper also proposes a new explanation as to why this may be the case.
منابع مشابه
What bloat? Cartesian Genetic Programming on Boolean problems
This paper presents an empirical study of the variation of program size over time, for a form of Genetic Programming called Cartesian Genetic Programming. Two main types of Cartesian genetic programming are examined: one uses a fully connected graph, with no redundant nodes, while the other allows partial connectedness and has redundant nodes. Studies are reported here for fitness based search ...
متن کاملEvolution of Robot Controller Using Cartesian Genetic Programming
Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolution through neutral search. Here, an integer based version of the representation is applied to a traditional problem in the field: evolving an obstacle avoiding robot controller. The technique is used to rapidly evolve controll...
متن کاملCode Bloat Problem in Genetic Programming
The concept of “bloat” in Genetic Programming is a well-established phenomenon characterized by variable-length genomes gradually increasing in size during evolution [1]. Bloat hampers the efficiency and ability of genetic programming for solving problems. A range of explanations have been proposed for the problem of bloat, including destructive crossover and mutation operators, selection press...
متن کاملAnalysis of the Effects of Elitism on Bloat in Linear and Tree-based Genetic Programming
Elitism, a technique which consists of copying, unchanged, one or more of the most fit individuals from one generation to the next, is widely used in generational evolutionary algorithms, including Genetic Programming (GP). Elitism ensures that the best individuals discovered in a generation (and hence in the whole run) are not lost, and, perhaps even more importantly, are made available to new...
متن کاملSize Fair and Homologous Tree Crossovers
Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size (i.e. less bloat) and no detrimental e ect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. While search e ciency is little e ected by initial conditions, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014