Indonesian Journal of Electrical Engineering and Computer Science Vol. 22, No. 1, April 2021, pp. 542~551 ISSN: 2502-4752, DOI: 10.11591/ijeecs.v22.i1.pp542-551  542 Journal homepage: http://ijeecs.iaescore.com Organizing sports matches with a hybrid monkey search algorithm Ruqaya Zedan Shaban 1 , Isra Natheer Alkallak 2 1 Computer unit, College of Medicine, University of Mosul, Mosul, Iraq 2 Department Basic Sciences, College of Nursing, University of Mosul, Mosul, Iraq Article Info ABSTRACT Article history: Received Oct 15, 2020 Revised Jan 15, 2021 Accepted Jan 29, 2021 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. Keywords: First keyword Second keyword Third keyword Fourth keyword Fifth keyword This is an open access article under the CC BY-SA license. Corresponding Author: Ruqaya Zedan Shaba Computer unit, College of Medicine University of Mosul, Mosul, Iraq. Email: rzs@uomosul.edu.iq 1. INTRODUCTION The term "monkey search algorithm" term was first coined via Mucherino and Seref in 2007. In detail, it is a metaheuristic for global optimization and type of swarm intelligence algorithms. This route was inspired by the simulation of mountain-climbing processes in its search for food. When the monkey starts climbing a different new mountain for the first time, it can only arbitrarily select the mountain's paths, as it has no previous mountain experience. Monkey search incorporates principles and techniques from other meta-heuristic approaches such as the genetic algorithm approach and the colony of ant. The mechanisms of the Monkey hunt algorithm are summarized in find solution, fitness function identification, initialization process, climbing procedure, watch-jump practice, somersault process, and finalization or termination [1-7]. The initial games to be played and the rules for pairing the winners in the subsequent games define tournaments. The number of rounds in a tournament is the maximum number of matches that must be played by each of the teams to win the tournament. A bye occurs around when a team does not play. A classic tournament is a tournament where a power of two is the number of teams and no byes are given. There are two brackets in double-elimination tournaments the winning bracket where the competition continues