University of Khartoum

A. Solving The Thesis Defense Timetabling Problem Using Heuristic Methods

A. Solving The Thesis Defense Timetabling Problem Using Heuristic Methods

Show full item record

Title: A. Solving The Thesis Defense Timetabling Problem Using Heuristic Methods
Author: Albashir, Maha Ali Mohamed
Abstract: This project aimed to solve the problem of timetabling specifically Thesis Defense Timetabling problem. For many decades solving timetabling problems and producing an optimal solution was considered a hard problem, since producing manual timetables requires a lot of time and effort. Solving thesis defense timetabling problem requires scheduling of group of projects into sessions and rooms and assigning a number of teachers to them as a committee according to certain constraints. This problem is new to the literature and a little work is done in the area of thesis defense timetabling problem. For solving this problem, hyper-heuristic approach was used. Hyper-heuristics are considered as an improvement methodologies that control a set of low level heuristics during the search process. In this study, the performance of set of low level heuristics was evaluated along with three move acceptance methods to produce the better solution from all. The best solution resulted in considerable reduction of constraints violations. This hyper-heuristic has been tested using a real world data coming from University of Khartoum.
URI: http://khartoumspace.uofk.edu/123456789/25814
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