Convergence Analysis of Evolutionary Programming Algorithm Based on a New Operator
Jianghui Dong · Science Technology and Engineering · 2009
In view of the defection of evolutionary programming(EP) and simplex method(SM) have the defects,whose respective merits are combined and an improved evolutionary programming algorithm with an operator of simplex method is proposed.The reflection of the simplex method is acted as a operator of evolutionary programming in this algorithm,thus it can combine the advantages of EP and simplex method.This method works well with fast speed of convergence,calculate simply and better performance of fitting and tracking.The convergence of this approach is analyzed and proved.