How to control search step size in fast evolutionary programming

This paper investigates three approaches to controlling the search step size in fast evolutionary programming (FEP): the first approach is based on using the different parameters in a Cauchy mutation; the second approach is through mixing different mutation operators; and the third approach is by applying cooperative coevolution in FEP. Experimental studies on some function optimization problems have shown that the three approaches can help FEP find better solutions while FEP maintains its fast convergence rate