Abstract

This paper presents an improved gene expression programming (GEP) algorithm, which combines the thought of classification and the original GEP operations. Meanwhile it designs a heuristic accelerating searching strategy and a diversity operator, which imports the thought of greedy algorithm and simulated annealing respectively. Experimental results based on comparisons between the improved GEP algorithm and the original GEP algorithm indicate that the improved GEP algorithm solves the contradiction between population diversity and algorithm convergence which has a faster convergence and better ability of searching optimization.

Full Text
Published version (Free)

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 call