Power law-based local search in differential evolution
by Harish Sharma; Jagdish Chand Bansal; K.V. Arya
International Journal of Computational Intelligence Studies (IJCISTUDIES), Vol. 2, No. 2, 2013

Abstract: Differential evolution (DE), like other probabilistic optimisation algorithms, sometimes exhibits premature convergence and stagnation. It is analysed by researchers that the DE is better in exploration of the search space compared to exploitation. In the solution search process of DE, there is enough chance to skip the true solution due to large step size. In order to balance the exploration and exploitation capability of the DE, a power law-based local search strategy is proposed and integrated with DE. In the proposed strategy, new solutions are generated around the best solution and it helps to enhance the exploitation capability of DE. The experiments on 14 un-biased test problems of different complexities show that the proposed strategy outperforms the basic DE and recent variants of DE namely, self-adaptive DE (SaDE) and scale factor local search DE (SFLSDE) in most of the experiments.

Online publication date: Sat, 19-Jul-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 Computational Intelligence Studies (IJCISTUDIES):
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