Fruit fly optimisation algorithm with adaptive sign processing
by Xiaodong Guo; Xueliang Zhang; Lifang Wang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 6, 2015

Abstract: Inspired by probability estimation for code-words in adaptive arithmetic coding, a fruit fly optimisation algorithm with adaptive sign processing is presented to solve a class of optimisation problems with negative optimum point. Sign probability of previously optimal solutions are dynamically calculated, and signs of smell concentration judgement value are adaptively created, then drosophila swarms in this way will search more fast and stationary than the ones gained in random manner. Simulation results for test functions show the adaptive manner in sign processing is efficient and potential for fruit fly optimisation algorithm.

Online publication date: Sun, 13-Dec-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