Bi-Criteria Simulated Annealing Algorithms for the Robust University Course Timetabling Problem
MetadataShow full item record
CitationGÜLCÜ, Ayla & Can AKKAN. "Bi-Criteria Simulated Annealing Algorithms for the Robust University Course Timetabling Problem". PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling, (2018): 129-136.
A bi-criteria version of the curriculum-based university timetabling problem of ITC-2007 is solved using a multi-objective simulated annealing (MOSA) algorithm that identifies an approximation to the optimal Pareto front. The two criteria are the penalty function as defined in ITC-2007 and a robustness function. The robustness function assumes one disruption occurs in the form of a period of an event (lecture) becoming infeasible for that event. The parameters of the MOSA algorithm are set using the Iterated FRace algorithm and then its performance is tested against a hybrid MOGA algorithm developed by the authors. The results show that MOSA provides better approximation fronts than the hybrid MOGA.
SourcePATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling