Genetic Algorithm Based Timetabling Program
Course Timetabling Problem is concerned with assigning a number of courses and instructors to classrooms by taking the constraints into consideration. Generally, this problem is typically resolved manually; and due to the large variety of constraints, resource limitations and complicated human factors involved, it takes a lot of time and manpower. It is considered as one of the most time-consuming problems faced by universities and colleges today. In this study, we aimed to develop a genetic algorithm-based timetabling software to bring a solution to course timetabling problem, which is a real world problem. This software allows constraints to be entered easily and allows that optimal solutions are found. To find the most suitable solution for optimization, two different solution methods, a full-genetic algorithm and a partial-genetic algorithm, were tested. Test results showed that when we start the full genetic algorithms from randomly generated initial population, it takes quite some time to obtain the appropriate solution. With the partial-genetic algorithm, an optimal solution was achieved much more quickly than the full genetic algorithm.
Copyright (c) 2019 Artificial Intelligence Studies
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Artificial Intelligence Studies (AIS) publishes open access articles under a Creative Commons Attribution 4.0 International License (CC BY). This license permits user to freely share (copy, distribute and transmit) and adapt the contribution including for commercial purposes, as long as the author is properly attributed.
For all licenses mentioned above, authors can retain copyright and all publication rights without restriction.