Accelerating Gaussian bare-bones differential evolution using neighbourhood mutation
by Liang Chen; Wenjun Wang; Hui Wang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 3, 2013

Abstract: Gaussian bare-bones differential evolution (GBDE) is a new DE algorithm which employs Gaussian random sampling to generate mutant vectors. Though this method can maintain population diversity and enhance the global search ability, it may result in slow convergence rate. In this paper, we present an improved GBDE (IGBDE) algorithm by using neighbourhood mutation to accelerate the evolution. Moreover, a modified parameter control method is utilised to adjust the crossover rate (CR). To verify the performance of our approach, 13 well-known benchmark functions are tested in the experiments. Simulation results show that IGBDE outperforms the original GBDE in terms of solution accuracy and convergence speed.

Online publication date: Sat, 10-May-2014

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 Computing Science and Mathematics (IJCSM):
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