New "Harder" Instances for the University Course Timetabling Problem

Lately we have been working with algorithms for the University Course Timetabling Problem (UCTP) that are specialised just for finding feasible timetables. The problem is that existing instances are just too easy! We have therefore created sixty new instances specially made to be "harder" with regards to finding a feasible timetable. The instance files are in the same *.tim format used for the International Timetabling Competition. All instances have at least one feasible solution and were generated by Rhyd Lewis using an automated instance generator by Ben Paechter.

Download the Instances

Some Results

Submitting your own Results

If you have chosen to use these sixty problem instances as benchmarks to your own algorithm and would like to display your results then please contact us.

 

Contacts
Rhyd Lewis r.lewis@napier.ac.uk
Ben Paechter b.paechter@napier.ac.uk

Page last updated: 11 May 2006