Isra Natheer Alkallak
University of Mosul

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Intelligent university timetable scheduling system using sudoku grid with magic square Isra Natheer Alkallak; Ruqaya Zedan Shaban; Yazen Hudhaifa Shakir Alnema
Bulletin of Electrical Engineering and Informatics Vol 11, No 3: June 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v11i3.3694

Abstract

Examination timetabling is problem faced by many academic educational institutions. The situation formulated as artificial intelligence problems as Sudoku grid with Magic square. Problem assigning a set of examinations to a fixed number of examination periods so that no student is required to take more than one examination at a time. The research describes two proposed heuristic algorithms to create university examination timetabling and avoiding the overlapping of exams. We proposed two algorithms, the first algorithm is based on Sudoku grid, a number of hard constraints as well as a number of soft constraints are proposed. We assigned exams as 9 to period as 27 slot times and to 3 rooms, with 3 classes. Each student in each class takes 9 exams While, the second algorithm simulates the classic manual methods while observing the hard and soft constraints of the problem. The heuristic approach used to further optimize the result to include hard constraints with soft. The proposed methodology for creating the Exam timetabling problem has been implemented in Matlab and closing the gap between classical methods and intelligent methods. The results obtained with very less computational effort through two algorithms.
Organizing sports matches with a hybrid monkey search algorithm Ruqaya Zedan Shaban; Isra Natheer Alkallak
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp542-551

Abstract

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.