A Linear Genetic Programming with Reusable Gene

Author

Wang, Zongyue ; Ma, Hongchao

Author_Institution

Sch. of Comput. Eng. Coll., Jimei Univ., Xiamen

fYear

2008

fDate

21-22 Dec. 2008

Firstpage

328

Lastpage

331

Abstract

In this paper, a novel genetic programming named linear genetic programming with reusable gene (LGPRG) has been proposed. This new method absorbed the merits of many other linear genetic programming. It codes with a simple, nearly unrestrained string. Based on its character of reused, more expressions could be contained in one chromosome without the increase of computation task.Further more, the expression segments in a chromosome are always integrated. This method is proved to be effective and stable from the complexity analysis and experiment.

Keywords

genetic algorithms; linear programming; chromosome expression segment; genetic algorithm; genetic coding method; genetic programming; linear genetic programming; reusable gene; unrestrained string; Algorithm design and analysis; Application software; Biological cells; Biological system modeling; Evolutionary computation; Genetic engineering; Genetic mutations; Genetic programming; Linear programming; Tree data structures; chromosome; genetic programming; linear genetic programming;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Information Technology Application Workshops, 2008. IITAW '08. International Symposium on

Conference_Location

Shanghai

Print_ISBN

978-0-7695-3505-0

Type

conf

DOI

10.1109/IITA.Workshops.2008.184

Filename

4731944