University of Khartoum

Solving The Thesis Defense Timetabling Problem Using Heuristic Methods

Solving The Thesis Defense Timetabling Problem Using Heuristic Methods

Show full item record

Title: Solving The Thesis Defense Timetabling Problem Using Heuristic Methods
Author: Hamad, Elham Yasir Mohamed Khair Hag
Abstract: The task of creating timetables for events and resources is one of the hardest computationally problems. It includes creating timetables for different purposes. An important type of them is Thesis Defense Timetables. Normally it is done manually but it requires a lot of time and effort. In details creating thesis defense timetables consists in composing the suitable committee for a set of graduation sessions and assigning each project group to one of the sessions according to certain constraints. This problem has not been tackled as much as other types of timetabling problems and it seems to be new to literature. Hyper-heuristic methods were used to solve this problem. Hyper-heuristics are heuristics search methods used to optimize solution by controlling a set of low level heuristics and choosing the appropriate one to apply. During this research the performance of set of low level heuristics combined with three move acceptance method was measured to generate the optimal solution. In this project the best acquired results were not optimal still they provide forward step by reducing number of constraints violations and can be used for further research. These results were acquired by testing the implemented hyper-heuristic method on real world data provided by University of Khartoum.
URI: http://khartoumspace.uofk.edu/123456789/25806
Date: 2017


Files in this item

Files Size Format View

This item appears in the following Collection(s)

Show full item record

Share

Search DSpace


Browse

My Account