@Article{10798587.2017.1294811,
AUTHOR = {Hong Choon Ong, Surafel Luleseged Tilahun, Wai Soon Lee, Jean Meadard T. Ngnotchouye},
TITLE = {Comparative Study of Prey Predator Algorithm and Firefly Algorithm},
JOURNAL = {Intelligent Automation \& Soft Computing},
VOLUME = {24},
YEAR = {2018},
NUMBER = {2},
PAGES = {359--366},
URL = {http://www.techscience.com/iasc/v24n2/39762},
ISSN = {2326-005X},
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.},
DOI = {10.1080/10798587.2017.1294811}
}