Comparative Analysis of Swarm-Based Metaheuristic Algorithms on Benchmark Functions

摘要

Swarm-based metaheuristic algorithms inspired from swarm systems in nature have produced remarkable results while solving complex optimization problems. This is due to their capability of decentralized control of search agents able to explore search environment more effectively. The large number of metaheuristics sometimes puzzle beginners and practitioners where to start with. This experimental study covers 10 swarm-based metaheuristic algorithms introduced in last decade to be investigated on their performances on 12 test functions of high dimensions with diverse features of modality, scalability, and valley landscape. Based on simulations, it can be concluded that firefly algorithm outperformed rest of the algorithms while tested unimodal functions. On multimodal functions, animal migration algorithm produced outstanding results as compared to rest of the methods. In future, further investigation can be conducted on relating benchmark functions to real-world optimization problem so that metaheuristic algorithms can be grouped according to suitability of problem characteristics.