Abstract
Gene expression programming (GEP) is a genotype/phenotype system that evolves computer programs of different sizes and shapes encoded in linear chromosomes of fixed length. However, the performance of basic GEP is highly dependent on the genetic operators' rate. In this work, we present a new algorithm called GEPSA that combines GEP and simulated annealing (SA), and GEPSA decreases the dependence on genetic operators' rate without impairing the performance of GEP. Three function finding problems, including a benchmark problem of prediction sunspots, are tested on GEPSA, results shows that importing simulated annealing can improve the performance of GEP.
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.
