Gene sorting in differential evolution

Abstract

Gene sorting is a method proposed in this article that consists of ordering trial vector's component in differential evolution (DE). This method tends to significantly increase the convergence speed of DE with just a little modification on the original algorithm. A benchmark set of 18 functions is used for comparing both algorithms. Most importantly, the proposed methods can be incorporated in other variants of DE to further increase their respective speeds; Iterated Function System Based Adaptive Differential Evolution (IFDE) is used in this paper as a variant example and it is about 5 times faster for 30-dimension problems. © 2009 Springer Berlin Heidelberg.