Two algorithmic enhancements for the parallel differential evolution Online publication date: Sat, 21-Mar-2015
by Matthieu Weber, Ferrante Neri, Ville Tirronen
International Journal of Innovative Computing and Applications (IJICA), Vol. 3, No. 1, 2011
Abstract: This paper proposes the use of two algorithms based on the parallel differential evolution. The first algorithm proposes the use of endemic control parameters within a parallel differential evolution algorithm; the differential evolution running at each subpopulation is associated with randomly initialised scale factor and crossover rate, which are then repeatedly updated during the optimisation process. The second algorithm proposes decomposing the search space of large-scale problems into lower-dimensionality subspaces, and associating each of these to one subpopulation of a parallel differential evolution algorithm. Each subpopulation is running a modified differential evolution algorithm, where the crossover function is limited to components of the subpopulation's associated subspace. According to numerical results, both algorithms seem to be clear improvements over the original parallel distributed evolution; they are simple, robust, and efficient algorithms suited for various applications.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Innovative Computing and Applications (IJICA):
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook