Scheduling Difficult to Schedule Examination using Memetic Algorithm

Abstract

The main objective in solving an examination timetable problem is to develop a conflict-free timetable where no students are sitting for more than one examination at the same time. UiTM Examination Timetabling problem is a complex problem due to its size and constraints. Part of the solution is to schedule a few selected courses that are difficult to schedule and schedule them using travelling salesman model. A travelling salesman model is implemented where vertices represent examinations while the edge between two vertices represents the number of students sitting for both examination (vertices). Memetic Algorithm was implemented to simulate the shortest path between two given vertices and try to find a reasonable solution. Experiments are performed to determine the performance of the algorithm with respect to its solution quality. The results show that it is able to produce good optimal solution.