Prey-predator algorithm for discrete problems: a case for examination timetabling problem

Abstract

The prey-predator algorithm is a metaheuristic algorithm inspired by the interaction between a predatorand its prey. Initial solutions are put into three categories: the better performing solution as the best prey, theworst performing solution as a predator, and the rest as ordinary prey. The best prey totally focuses on exploitingits neighborhood while the predator explores the search space searching for a promising region in the search space. Theordinary prey will be affected by these two extreme search behaviors of exploration and exploitation. The algorithm hasbeen tested and found to be effective in solving different problems arising from different disciplines including engineering,tourism, and management. Originally, the algorithm was designed to deal with continuous problems. However, manyproblems arising from real aspects are not continuous. Hence, in this paper the prey-predator algorithm will be extendedto suit discrete problems. Examination timetabling is used to test the approach. The simulation results with appropriatestatistical analysis show that the approach is as good as the cumulative best performance of results recorded in theliterature for the selected benchmark problems.