An algorithm based on Adaptive Large Neighborhood Search (ALNS) for solving the generalized High School Timetabling problem in XHSTT-format (Post et al (2012a)) is presented. This algorithm was among the nalists of round 2 of the International Timetabling Competition 2011 (ITC2011). For problem description and results we refer to Post et al (2012b).
Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (patat 2012), 2012, p. 489-492
Main Research Area:
9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012)Practice and Theory of Automated Timetabling