Title: Applying distance sorting selection in differential evolution

Authors: Yuxiang Shao; Zhe Chen; Yuan Liu

Addresses: School of Computer Science, Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, No. 388 Lumo Road, Wuhan, 430074, China ' School of Computer Science, Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, No. 388 Lumo Road, Wuhan, 430074, China ' School of Computer Science China University of Geosciences, Wuhan, China

Abstract: Differential evolution is eligible for solving continuous optimisation 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 distance sorting selection where the individual has the best fitness among parents and offspring is selected firstly. Then, the genotype distance from another individual to it, which resembles the distance in their chromosome structure, can be estimated to decide whether the former individual is selected. Under the control of an adaptive scheme as proposed in the paper, we use it to replace the original selection of the CoBiDE in runs from time to time. Experimental results show that, for many among the 25 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.

Keywords: exploration and exploitation balance; distance; stagnation; premature convergence; CoBiDE.

DOI: 10.1504/IJIIDS.2019.102328

International Journal of Intelligent Information and Database Systems, 2019 Vol.12 No.1/2, pp.79 - 90

Received: 17 Oct 2018
Accepted: 16 Feb 2019
Published online: 18 Sep 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article