Timetable Scheduling System Using Genetic ALGORITHM(s)
The university course timetabling problem is an NP-complete problem which makes it challenging to solve considering all the constraints that come with it, be it hard or soft. Hard constraints cannot be violated when generating any feasible timetable solution. An example is a lecturer not being able to teach two courses at a time. Soft constraints can be broken without any significant conflict in the schedule. An example is a lecturer preferring not to teach two classes consecutively. A feasible timetable can be challenging to create, considering the number of courses run with the combinations of courses that a particular student can take. Every semester, courses are rescheduled after registrations are completed due to these constraints, and as such, many students are disadvantaged. This project seeks to solve this problem by developing a timetable algorithm to create a feasible timetable with no clashes. A genetic algorithm is used in this case to help solve the problem. An optimal schedule is generated after the algorithm is developed. The resulting timetable is void of clashes.
Applied project submitted to the Department of Computer Science and Information Systems, Ashesi University, in partial fulfillment of Bachelor of Science degree in Computer Science, May 2022
Takyi, K. A. (2022). Timetable Scheduling System Using Genetic ALGORITHM(s). Ashesi University.