Adaptively Calling Selection Based on Distance Sorting in CoBiDE
Differential Evolution is fit for solving continuous optimization problems. So far, the imbalance between exploration and exploitation in DE runs often leads to the failure to obtain good solutions. In this paper, we propose selection based on distance sorting. In such selection, the individual has the best fitness among parents and offspring is selected firstly. Then, the genotype distance from another individual to it, the distance in their chromosome structure, decides whether the former individual is selected. Under the control of a adaptive scheme proposed by us, we use it replace the original selection of the CoBiDE in runs from time to time. Experimental results show that, for many among the twenty-five CEC 2005 benchmark functions, which have the similar changing trend of diversity and fitness in runs, our adaptive scheme for calling selection based on distance sorting brings improvement on solutions.
KeywordsExploration and exploitation balance Secondary selection Stagnation Premature convergence CoBiDE
- 2.Awad, N.H., Ali, M.Z., Suganthan, P.N., Reynolds, R.G.: An ensemble sinusoidal parameter adaptation incorporated with L-shade for solving CEC2014 benchmark problems. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 2958–2965. IEEE (2016)Google Scholar
- 13.Mohamed, A.W., Suganthan, P.N.: Real-parameter unconstrained optimization based on enhanced fitness-adaptive differential evolution algorithm with novel mutation. Soft Comput. 1–21 (2017)Google Scholar
- 22.Zheng, L.M., Liu, L., Zhang, S.X., Zheng, S.Y.: Enhancing differential evolution with interactive information. Soft Comput. 1–20 (2017)Google Scholar