Genetic programming paradigm based on simulated annealing algorithm
Cheng Zhuan-liu · Jisuanji gongcheng yu sheji · 2006
Genetic programming(GP) solves problems by using ideas of genetic algorithms and generating computer programs.But when it is used to solve a certain complex problems,some tough problems will come out.In particular,too much of the computer memory and CPU time are consumed so that the function of computer will be highly weakened.To overcome these difficulties in solving problems by using traditional genetic programming paradigm,symbolic regression problem is taken as example,a genetic programming paradigm based on simulated annealing algorithm is put forward,and the ability of GP system in solving problems is improved.