The next step in this stage is to assign the best fitness valueFitWbest as the fitness value (FitDk) for the current DE’s solution XDk, k = 1, 2, . . . , ND. After all solutions in XD are used then the best DE’s solution XDb is determined which has the best FitDbest. Then update the solution in XD using the operators of DE algorithm(i.e., the crossover, mutation, selection) until the stopping conditions are met (here we used the maximum number of iterations(MaxiterD))
The next step in this stage is to assign the best fitness valueFitWbest as the fitness value (FitDk) for the current DE’s solution XDk, k = 1, 2, . . . , ND. After all solutions in XD are used then the best DE’s solution XDb is determined which has the best FitDbest. Then update the solution in XD using the operators of DE algorithm<br>(i.e., the crossover, mutation, selection) until the stopping conditions are met (here we used the maximum number of iterations<br>(MaxiterD))
正在翻译中..
The next step in this stage is to assign the best fitness valueFitWbest as the fitness value (FitDk) for the current DE’s solution XDk, k = 1, 2, . . . , ND. After all solutions in XD are used then the best DE’s solution XDb is determined which has the best FitDbest. Then update the solution in XD using the operators of DE algorithm<br>(i.e., the crossover, mutation, selection) until the stopping conditions are met (here we used the maximum number of iterations<br>(MaxiterD))
正在翻译中..