Efficient program generation by evolving graph structures with multi-start nodes

doi:10.1016/j.asoc.2011.01.033

Efficient program generation by evolving graph structures with multi-start nodes

2011-06-01

3

PRE

AI

DOI：10.1016/j.asoc.2011.01.033

Original

Original request for help

Save

Abstract

En 中文

Automatic program generation is one of the applicable fields of evolutionary computation, and Genetic Programming (GP) is the typical method for this field. On the other hand, Genetic Network Programming (GNP) has been proposed as an extended algorithm of GP in terms of gene structures. GNP is a graph-based evolutionary algorithm and applied to automatic program generation in this paper. GNP has directed graph structures which have some features inherently, for example, re-usability of nodes and the small number of nodes. These features contribute to creating complicated programs with compact structures and never cause bloat. In this paper, the extended algorithm of GNP is proposed, which can create plural programs simultaneously in one individual by using multi-start nodes. In addition, GNP can evolve the programs in one individual considering the fitness and also its standard deviation in order to evolve the plural programs efficiently. In the simulations, Even-n-Parity problem and Mirror Symmetry problem are used for the performance evaluation, and the results show that the proposed method outperforms the standard GNP with single start node. (C) 2011 Elsevier B.V. All rights reserved.

Keywords:

Evolutionary computation

Program generation

Graph structure

Even-n-Parity problem

Mirror Symmetry problem

Efficient program generation by evolving graph structures with multi-start nodes

Abstract

AI Summary

Journal

Organization

Cited Papers