Improving the JADE algorithm by clustering successful parameters Online publication date: Sat, 24-Dec-2016
by Zhijian Li; Jinglei Guo; Shengxiang Yang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 11, No. 3, 2016
Abstract: Differential evolution (DE) is one of the most powerful and popular evolutionary algorithms for real parameter global optimisation problems. However, the performance of DE highly depends on the selection of control parameters, e.g. the population size, scaling factor and crossover rate. How to set these parameters is a challenging task because they are problem dependent. In order to tackle this problem, a JADE variant, denoted CJADE, is proposed in this paper. In the proposed algorithm, the successful parameters are clustered with the k-means clustering algorithm to reduce the impact of poor parameters. Simulation results show that CJADE is better than, or at least comparable to, several state-of-the-art DE algorithms.
Online publication date: Sat, 24-Dec-2016
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org