By Topic

Gene expression programming based on simulated annealing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Jiang Siwei ; Coll. of Comput., China Univ. of Geosciences, Wuhan, China ; Cai Zhihua ; Zeng Dan ; Liu Yadong
more authors

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.

Published in:

Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005.  (Volume:2 )

Date of Conference:

23-26 Sept. 2005