Abstract
University timetabling is an NP-hard problem, which means that the amount of computation required to find solutions increases exponentially with problem size. Timetabling is subject to hard constraints that must be satisfied in order to produce feasible timetables and soft constraints, which are not absolutely essential. This paper describes the Stochastic Optimisation Timetabling Tool (SOTT) that has been developed for university course timetabling. Genetic Algorithms (GA), Simulated Annealing (SA) and random search are embedded in the SOTT. The algorithms include a repair process, which ensures that all infeasible timetables are rectified. This prevents clashes and ensures that the rooms are sufficiently large to accommodate the classes. The algorithms also evaluate timetables in terms of soft constraints: minimising student movement; avoiding fragmentation in the timetables for students and lecturers; and satisfying lecturers’ preferences for the timing of classes. The algorithms were tested using two sets of timetabling data from a collaborating university. Both GA and SA produced very good timetables, but the results obtained from SA were slightly better than those using GA. However, the GA was 54% faster than SA.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
