Dual of DE: a new scheme of differential evolution algorithm Online publication date: Mon, 03-Aug-2015
by Changshou Deng; Yucheng Tan; Bingyan Zhao; Yanlin Yang; Yan Liu; Hu Peng
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 8, No. 4, 2015
Abstract: Differential Evolution (DE) is a class of powerful evolutionary algorithms for global numerical optimisation. Using the mechanisms of complementarities that exist in nature, opposition-based learning has been successfully used to generate opposite number to enhance the search ability of DE. In this paper with the opposite concept for the scheme of DE, a completely new scheme of DE is proposed. Based on the formal analysis of traditional DE and the concept of duality borrowed from mathematics, Dual of DE is derived. Then the Dual of DE has been tested on 18 commonly used benchmark problems and the results obtained were compared to those of the traditional DE. Experimental results show that the Dual of DE can serve as a good complementary scheme for the traditional DE in most of the considered problems. Thus it can be an alternative in solving real-world optimisation problems.
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 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 subs@inderscience.com