A hybrid global optimisation algorithm based on locally filled functions and cluster analysis
by Hong-Xuan Huang, Yu Zhao
International Journal of Computational Science and Engineering (IJCSE), Vol. 3, No. 3, 2007

Abstract: In this paper we will extend the definition of a filled function and propose a new definition of a locally filled function. The difference between the locally filled function and the classical filled function is illustrated by an example. The existence of a locally filled function is also studied in theory. Based on the locally filled function and cluster analysis technique we will present a hybrid global optimisation algorithm. The algorithm integrates the deterministic and stochastic searching techniques and has a very powerful globally searching ability. Numerical performance of the new hybrid algorithm is demonstrated by two examples about the Shubert I and Sine-Square I functions.

Online publication date: Fri, 18-Apr-2008

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 Science and Engineering (IJCSE):
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