Genetic Algorithm For University Course Timetabling Problem

Creating timetables for institutes which deal with transport, sport, workforce, courses, examination schedules, and healthcare scheduling is a complex problem. It is difficult and time consuming to solve due to many constraints. Depending on whether the constraints are essential or desirable they are categorized as ‘hard’ and ‘soft’, respectively. Two types of timetables, namely, course and examination are designed for academic institutes. A feasible course timetable could be described as a plan for the movement of students and staff from one classroom to another, without conflicts. Being an NP-complete problem, many attempts have been made using varying computational methods to obtain optimal solutions to the timetabling problem. Genetic algorithms, based on Darwin's theory of evolution is one such method. The aim of this study is to optimize a general university course scheduling process based on genetic algorithms using some defined constraints.

Name thesis:degree_name

M.S. in Engineering Science

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer and Information Science

Year dc:date.available

2017

Author dc:creator

• Herath, Achini Kumari

Contributors dc:contributor

• Conrad Cunningham
• Yixin Chen

• Evolutionary Algorithms
• Genetic Algorithms
• Metaheuristics
• Optimization
• Timetabling
• Computer Sciences

Repository record dc:identifier

https://egrove.olemiss.edu/etd/443

OAI identifier oai:identifier

oai:egrove.olemiss.edu:etd-1442