A new hybrid algorithm for unconstrained optimisation problems
by Jida Huang; Xinyu Li; Liang Gao
International Journal of Computer Applications in Technology (IJCAT), Vol. 46, No. 3, 2013

Abstract: A new optimisation algorithm which hybridises cuckoo search (CS) with teaching-learning-based optimisation (TLBO) is proposed for solving unconstrained optimisation problems. The new algorithm involves the concept of Lévy flight of the solutions and the information exchange based on teaching-learning process between the best solutions. The proposed method, combining the advantage of CS and TLBO, can strengthen the local search ability and accelerate the convergence rate. The effectiveness and performance of the method is evaluated on several large scale non-linear benchmark functions with different characteristics, and the results are compared with CS and TLBO. The experimental results show that the proposed algorithm outperforms other two algorithms and has achieved satisfactory improvement.

Online publication date: Wed, 29-May-2013

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 Computer Applications in Technology (IJCAT):
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