Extended prey-predator algorithm with a group hunting scenario (Q1748498)

Summary: Prey-predator algorithm (PPA) is a metaheuristic algorithm inspired by the interaction between a predator and its prey. In the algorithm, the worst performing solution, called the predator, works as an agent for exploration whereas the better performing solution, called the best prey, works as an agent for exploitation. In this paper, PPA is extended to a new version called \(nm\)-PPA by modifying the number of predators and also best preys. In \(nm\)-PPA, there will be \(n\) best preys and \(m\) predators. Increasing the value of \(n\) increases the exploitation and increasing the value of \(m\) increases the exploration property of the algorithm. Hence, it is possible to adjust the degree of exploration and exploitation as needed by adjusting the values of \(n\) and \(m\). A guideline on setting parameter values will also be discussed along with a new way of measuring performance of an algorithm for multimodal problems. A simulation is also done to test the algorithm using well known eight benchmark problems of different properties and different dimensions ranging from two to twelve showing that \(nm\)-PPA is found to be effective in achieving multiple solutions in multimodal problems and also has better ability to overcome being trapped in local optimal solutions.