Differential evolution algorithm with dynamic population scheme
by Xinyu Zhou; Mingwen Wang; Jianyi Wan
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 10, No. 3, 2016

Abstract: Differential evolution (DE) is an efficient population-based evolutionary algorithm for solving optimisation problems. Its control parameters have significant influence on performance. In the past few years, how to adjust the scaling factor F and crossover probability CR has attracted a lot of attention. However, few works have been focused on the parameter of population size. So in this paper, we designed a dynamic population scheme to manage the population size of DE. This scheme mainly consists of two parts: the logistic model and opposition-based learning. The first part is dedicated to calculate how many new individuals should be added into the population, while the second part is used to generate these new individuals. A series of experiments is conducted on 25 well-known benchmark functions including shifted and rotated ones. Results show that our approach shows promising performance.

Online publication date: Fri, 24-Jun-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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:

Username:        Password:          Forgotten your 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