A hybrid firefly algorithm based on modified neighbourhood attraction
by Rongfang Chen; Jun Tang
International Journal of Innovative Computing and Applications (IJICA), Vol. 13, No. 5/6, 2022

Abstract: Some studies reported that firefly algorithm (FA) had high computational time complexity. To tackle this problem, different attraction models were designed including random attraction, probabilistic attraction, and neighbourhood attraction. This paper concentrates on improving the efficiency of neighbourhood attraction. Then, a hybrid FA based on modified neighbourhood attraction (called HMNaFA) is proposed. In our new approach, the best solution selected from the current neighbourhood is used for competition. If the best solution wins the competition, the current solution flies towards the best one; otherwise a new neighbourhood search is employed to produce high quality solutions. Experiments are validated on several classical problems. Simulation results show HMNaFA surpasses FA with neighbourhood attraction and several other FA algorithms.

Online publication date: Mon, 23-Jan-2023

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 Innovative Computing and Applications (IJICA):
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