Specialised Recombinative Operators for Timetabling Problems

This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of feasibility. That is that there are no conflicts and no overfilled rooms. Various approaches to solving the timetabling problem using evolutionary computing methods are first compared. The recombination operators are then presented and various alternatives for incorporating heuristic knowledge in the search are described. Finally, results are presented comparing the operators on a real timetabling problem.

• Type: Conference
• Year: 1995
• Where: AISB
• Authors: Edmund K. Burke, Dave Elliman, Rupert F. Weare
• Keywords: AISB 1995, Artificial Intelligence, Real Timetabling Problem, Recombination Operators, Timetabling Problem