Organizing sports matches with a hybrid monkey search algorithm

Ruqaya Zedan Shaban, Isra Natheer Alkallak


This academic piece of the paper illustrates an approach of organizing sports matches to be as a tool of sports schedule maker via a proposed hybrid Monkey search algorithm by doubles elimination tournament. Input are a set of teams represented by monkeys. It states that the natural behavior of monkeys and its climbing to obtain (solution) through uphill (climbing), watch-jumping, and somersault process. The parameters in the climb were represented by whether or not sports team won. The distribution of the teams, whether in the upper or the lower half, represented in the watch-jumping by mathematical equations, in addition to representing the variables in somersault process. The consequences behind the suggested algorithm used have tackled steps to reach an optimal schedule for a variety of teams for the same championship. The team cannot play more than two consecutive matches with the condition of starting with a random population of feasible solutions. The performance of the presented algorithm was very well through providing a flexible and easy organization of sports matches without using classic or manual routine. Furthermore, the search space reduced so that can give a guarantee to achieve a globally optimum solution. The software platform was MATLAB m-files.


Optimization; Monkey algorithm; Heuristic; Combinatorial

Total views : 44 times


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics