Differential evolution and threshold accepting hybrid algorithm for unconstrained optimisation
by Nikunj Chauhan, V. Ravi
International Journal of Bio-Inspired Computation (IJBIC), Vol. 2, No. 3/4, 2010

Abstract: This paper develops a hybrid global optimisation metaheuristic methodology for solving unconstrained optimisation problems. The hybrid, to be called DETA, comprises two global optimisation algorithms viz. differential evolution (DE) and threshold accepting (TA) in tandem. While working with DE on benchmark problems, we noticed that it slows down before convergence is achieved. After analysing the possible reason for this shortcoming, we propose DETA to address it. DETA works in two phases: Phase 1 implements the original DE with relaxed convergence criterion. Then, a switch over is made from Phase 1 to Phase 2, where TA is used to quickly guide the search to global optimum. Performance of DETA is compared with that of DE on 26 unconstrained benchmark problems. The results obtained indicate that DETA hybrid is much superior to DE in terms of speed for the same level of accuracy.

Online publication date: Fri, 07-May-2010

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 Bio-Inspired Computation (IJBIC):
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