Courses timetabling based on hill climbing algorithm

Abstrak

In addition to its monotonous nature and excessive time requirements, the manual school timetable scheduling often leads to more than one class being assigned to the same instructor, or more than one instructor being assigned to the same classroom during the same slot time, or even leads to exercise in intentional partialities in favor of a particular group of instructors. In this paper, an automated school timetable scheduling is presented to help overcome the traditional conflicts inherent in the manual scheduling approach. In this approach, hill climbing algorithms have been modified to transact hard and soft constraints. Soft constraints are not easy to be satisfied typically, but hard constraints are obligated. The implementation of this technique has been successfully experimented in different schools with various kinds of side constraints. Results show that the initial solution can be improved by 72% towards the optimal solution within the first 5 seconds and by 50% from the second iteration while the optimal solution will be achieved after 15 iterations ensuring that more than 50% of scientific courses will take place in the early slots time while more than 50% of non-scientific courses will take place during the later time's slots.