Evolving choice structures for genetic programming

Shuaiqiang Wang, Jun Ma*, Jiming LIU, Xiaofei Niu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

It is quite difficult but essential for Genetic Programming (GP) to evolve the choice structures. Traditional approaches usually ignore this issue. They define some "if-structures" functions according to their problems by combining "if-else" statement, conditional criterions and elemental functions together. Obviously, these if-structure functions depend on the specific problems and thus have much low reusability. Based on this limitation of GP, in this paper we propose a kind of termination criterion in the GP process named "Combination Termination Criterion" (CTC). By testing CTC, the choice structures composed of some basic functions independent to the problems can be evolved successfully. Theoretical analysis and experiment results show that our method can evolve the programs with choice structures effectively within an acceptable additional time.

Original languageEnglish
Pages (from-to)871-876
Number of pages6
JournalInformation Processing Letters
Volume110
Issue number20
DOIs
Publication statusPublished - 30 Sep 2010

Scopus Subject Areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

User-Defined Keywords

  • Choice structure
  • Evolutionary computation
  • Genetic programming
  • Program derivation

Fingerprint

Dive into the research topics of 'Evolving choice structures for genetic programming'. Together they form a unique fingerprint.

Cite this