Estimation of distribution algorithm combined with chaotic sequence for dynamic optimisation problems
by Fahong Yu; Wenping Li; Jiang Tao; Kun Deng; Longhua Ma; Feng He
International Journal of Computing Science and Mathematics (IJCSM), Vol. 8, No. 1, 2017

Abstract: To track the optima in dynamic environments with estimation of distribution algorithm, maintenance of the diversity of the population is an essential requirement. Taking this point into consideration, this paper proposes an estimation of distribution algorithm combined with a chaotic sequence (CEDA) for dynamic optimisation problems. In CEDA, a chaotic sequence is introduced to maintain the diversity of population and enhance improve the local search ability. Many numerical experiments are reported in order to compare the performance of the CEDA with the self-adaptive approach by other authors. The numerical results show that the performance of our algorithm is superior to that of other published algorithms on two dynamic benchmark problems.

Online publication date: Mon, 20-Mar-2017

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