Enhanced versions of differential evolution: state-of-the-art survey Online publication date: Thu, 31-Jul-2014
by Wali Khan Mashwani
International Journal of Computing Science and Mathematics (IJCSM), Vol. 5, No. 2, 2014
Abstract: Over the past few years, differential evolution (DE) is generally considered as a reliable, accurate and robust population-based evolutionary algorithm (EA). It is capable of handling non-differentiable, non-linear, multi-modal and constrained optimisation problems. However, it suffers from slow convergence rate and takes large computational time for optimising the computationally expensive objective functions including problems dimensionality, several local and global optimums. Over the last few years, several attempts have been made to overcome these drawbacks of simple DE by employing the key features of some existing evolutionary algorithms either self-adaptively and have been formed in the forms of enhanced versions of DEs. This paper reviews those efforts and gathered state-of-the-art survey of the DEs that included some novel self-adaptive mechanisms, different ensemble techniques, efficient local search optimisers and various constrained handling techniques.
Online publication date: Thu, 31-Jul-2014
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 Computing Science and Mathematics (IJCSM):
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 email@example.com