A hybrid firefly algorithm based on modified neighbourhood attraction

摘要

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.