Open Access

ARTICLE

Comparative Study of Prey Predator Algorithm and Firefly Algorithm

Hong Choon Ong^a, Surafel Luleseged Tilahun^b, Wai Soon Lee^a, Jean Meadard T. Ngnotchouye^b

^a School of Mathematical Sciences, Universiti Sains Malaysia, 11800 Minden, Penang, Malaysia;
^b School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Private Bag X01, Scottsville, Pietermaritzburg, South Africa

* Corresponding Author: Surafel Luleseged Tilahun,

Intelligent Automation & Soft Computing 2018, 24(2), 359-366. https://doi.org/10.1080/10798587.2017.1294811

Abstract

Metaheuristic algorithms are found to be promising for difficult and high dimensional problems. Most of these algorithms are inspired by different natural phenomena. Currently, there are hundreds of these metaheuristic algorithms introduced and used. The introduction of new algorithm has been one of the issues researchers focused in the past fifteen years. However, there is a critic that some of the new algorithms are not in fact new in terms of their search behavior. Hence, a comparative study in between existing algorithms to highlight their differences and similarity needs to be studied. Apart from knowing the similarity and difference in search mechanisms of these algorithms it will also help to set criteria on when to use these algorithms. In this paper a comparative study of prey predator algorithm and firefly algorithm will be discussed. The discussion will also be supported by simulation results on selected twenty benchmark problems with different properties. A statistical analysis called Mann—Whitney U 2 test is used to compare the algorithms. The theoretical as well as simulation results support that prey predator algorithm is a more generalized search algorithm, whereas firefly algorithm falls as a special case of prey predator algorithm by fixing some of the parameters of prey predator algorithm to certain values.

---

Keywords

---