A 3 Step Meta-heuristic for the Timetabling problem
Time tabling is a complex optimisation problem given its large number of constraints (e.g., no overlap between core modules for a particular year) or cost functions (e.g., minimise the distance between any two consecutive lectures/TA/labs). Many techniques have been used to address various versions of the problem, such as, Constraint-based methods or Meta-heuristics methods, but … Read more