Estimation of distribution algorithm with scatter search for dynamic optimisation problems
by Fahong Yu; Feng He; Meijia Chen; Longhua Ma; Zheming Lu
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 3, 2015

Abstract: Aiming at the trouble to track the optima in dynamic environments with estimation of distribution algorithms (EDAs). An estimation of distribution algorithm with scatter search (EDASS) is proposed in this paper. Its basic idea is to employ a scatter search to increase the diversity in a guided fashion and an adaptive leader clustering method to locate multiple local optima. Both the information of current population and the part history information were referred for building probability model. The experimental results show that the EDASS is effective for dynamic optimisation problems.

Online publication date: Thu, 28-May-2015

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