Title: A comparative study of linear encoding in Genetic Programming
Abstract: Genetic Programming is a widely used technique to solve many optimization problems. The original representation of a solution is a tree structure. To improve its search capability there are many proposals for encoding data structure of a solution of Genetic Programming as a linear code. However there are a few work in comparing between these proposals. This work presents a systematic way to compare three popular techniques for linear encoding in Genetic Programming. They are Linear Genetic Programming, Gene Expression Programming and Multi-Expression Programming. Ten problems in Symbolic Expressions are defined and are used as benchmarks to compare the effectiveness of these proposals against the baseline standard Genetic Programming. The metrics of comparison are the Success Rate and the absolute error. The discussion and comparison of the strength and weakness of each method are also presented.
Publication Year: 2012
Publication Date: 2012-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 10
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot