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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
