Evolutionary algorithm considering program size: efficient program evolution using grape

Authors:
Shinichi Shirakawa;Tomoharu Nagao
Affiliations:
Yokohama National University, Yokohama, Kanagawa, Japan;Yokohama National University, Yokohama, Kanagawa, Japan
Venue:
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Year:
2008

Citing 7
Cited 0

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
PADO: a new learning architecture for object recognition

Symbolic visual learning
A computationally efficient evolutionary algorithm for real-parameter optimization

Evolutionary Computation
Cartesian Genetic Programming

Proceedings of the European Conference on Genetic Programming
Graph structured program evolution

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Balancing accuracy and parsimony in genetic programming

Evolutionary Computation
Effects of code growth and parsimony pressure on populations in genetic programming

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Today, a lot of Automatic Programming techniques have been proposed and applied various fields. Graph Structured Program Evolution (GRAPE) is one of the recent Automatic Programming techniques. GRAPE succeeds in generating the complex programs automatically. In this paper, a new generation alternation model for GRAPE, called Evolutionary Algorithm Considering Program Size (EACP), is proposed. EACP maintains the diversity of program size in the population by using particular fitness assignment and generation alternation. We apply EACP to three test problems, factorial, exponentiation and sorting a list. And we show the effectiveness of EACP and confirm evolution of maintaining the diversity of program size.