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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Innovative Computing and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
