Search Step Size Control In Fast Evolutionary Programming

The second approach, called IFEP, to controlling search step size in FEP is to use both Cauchy mutation and Gaussian mutation. IFEP di ers from FEP slightly. Instead of using Cauchy mutation alone in FEP, IFEP generates two o spring from each parent, one by Cauchy mutation and the other by Gaussian mutation. The better one is then chosen as the o spring. The rest of the algorithm is exactly the same as FEP.