Skip to main content
Article thumbnail
Location of Repository

A Comparison of Several Linear Genetic Programming

By Mihai Oltean and C. Grosan

Abstract

A comparison between four evolutionary techniques for solving symbolic regression problems is presented in this paper. The compared methods are multi-expression programming, gene expression programming, grammatical evolution, and linear genetic programming. The comparison includes all aspects of the considered evolutionary algorithms: individual representation, fitness assignment, genetic operators, and evolutionary scheme. Several numerical experiments using five benchmarking problems are carried out. Two test problems are taken from PROBEN1 and contain real-world data. The results reveal that multi-expression programming has the best overall behavior for the considered test problems

Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.5512
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.ubbcluj.ro/~cgro... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.