Heuristic search strategy of evolutionary programming

Evolutionary programming (EP) has been successfully applied to many optimization problems in recent years. However, most experimental results of EP have been obtained under low-dimension condition and weren´t perfect under high-dimension condition. A new evolutionary programming method which named Heuristic Search Strategy (HSS) was proposed for solving high-dimension optimization problem. It can grasp the information of distribution-status of population by control four parameters of population in the evolution process and adjust the mutation size of individual according to such information. HSS was test by using benchmark functions, the experimental results show that performance of HSS is better than other EP method obviously under high-dimension condition.