A bi-criteria simulated annealing algorithm for the robust university course timetabling problem
||The system is temporarily closed to updates for reporting purpose.
Gülcü, Ayla and Akkan, Can (2018) A bi-criteria simulated annealing algorithm for the robust university course timetabling problem. In: 12th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2018), Vienna, Austria
Official URL: https://patatconference.org/patat2018/files/proceedings/paper12.pdf
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.
Repository Staff Only: item control page