ITC 2007
The 2007 International Timetabling Competition is related to the PATAT conference : Pratice and Theory of Automated Timetabling. All the details regarding the competition can be found at this page: ITC2007.
We entered and won the second Track of the competition on Course Timetabling. A technical description of the exact problem can be found here : Post Enrolment based Course Timetabling. This problem comes from the problem used during the 2002 competition and has been enriched with hard constraints to increase the difficulty of finding feasible solution. The benchmark (format) is made of 24 instances (only 16 available for the moment) :
- The instances of 2007 : inst2007.zip
- The instances of 2002 : inst2002.zip
- Two sets of five instances used in a number of papers published on this problem : small.zip and medium.zip
Our algorithm can be dowloaded here : solverPatat08.jar
How to run the algorithm
A readme giving all the details to run the algorithm is available here : userguidePatat08.txt
All the sources of the java code (including the jar libraries to compile the code) can be dowloaded here : srcPatat08.zip
References
[1] M. Chiarandini, M. Birattari, K. Socha, and O. Rossi-Doria. An effective hybrid algorithm for university course timetabling. J. Scheduling, 9(5):403–432, 2006.
[2] P. Kostuch. The university course timetabling problem with a three-phase approach. In PATAT, pages 109–125, 2004.
[3] R. Lewis, B. Paechter, and B. McCollum. Post enrolment based course timetabling: A description of the problem model used for track two of the second international timetabling competition. Technical report, Cardiff University, 2007.
[4] S. Abdullah, E. K. Burke, and B. McCollum. Using a randomised iterative improvement algorithm with composite neighbourhood structures for course timetabling. In MIC 05: The 6th Meta-Heuristic International Conference, 2005.