Timetabling Results

Within the context of  the PATAT 2002 proceeded a timetabling competition, the itc2002. Therefor four benchmark instances of the
Univeristy of Udine have been published. For all test-instances we present the results according to the basic problem formulation of
 Di Gaspero and Schaerf  and the problem formulation of the itc2007. For the older formulation we are able to solve alle instances optimal.


Test-Instances




Results of Test instances according to the original problem formulation:
Name Value Status Solution
Test1.ctt 212 optimal test1_origFor.sol
Test2.ctt 8 optimal test2_origFor.sol
Test3.ctt 35 optimal test3_origFor.sol
Test4.ctt 27 optimal test4_origFor.sol


Results of the Test instances according to the original problem formulation:
Name Value Status Solution
Test1.ctt 242 feasable test1_itc2007.sol
Test2.ctt 29 feasable test2_itc2007.sol
Test3.ctt 76 feasable test3_itc2007.sol
Test4.ctt 72 feasable test4_itc2007.sol




DDS-Instances


The SATT Group of the University of  Udine(SATT) provides even more real-world instances in the web (instances).In the next table we
show our results for the DDS instances according to the original and and the itc2007 formulations.


Results of DDS instances according to the original problem formulation:

Name Value Status Solution
DDS1.ctt 39 optimal dds1_origFor.sol
DDS2.ctt 0 optimal dds2_origFor.sol
DDS3.ctt 0 optimal dds3_origFor.sol
DDS4.ctt 16 feasable dds4_origFor.sol
DDS5.ctt 0 optimal dds5_origFor.sol
DDS6.ctt 0 optimal dds6_origFor.sol
DDS7.ctt 0 optimal dds7_origFor.sol

 

Results of DDS instances according to the itc2007 formulation:

Name Value Status Solution
DDS1.ctt 122 feasable dds1_itc2007.sol
DDS2.ctt 0 optimal dds2_itc2007.sol
DDS3.ctt 0 optimal dds3_itc2007.sol
DDS4.ctt 48 feasable dds4_itc2007.sol
DDS5.ctt 0 optimal dds5_itc2007.sol
DDS6.ctt 4 feasable dds6_itc2007.sol
DDS7.ctt 0 optimal dds7_itc2007.sol




Comp01-Comp07


Results of Comp01-Comp07 instances according to the original problem formulation:
Name Value Status Solution
Comp01.ctt 4 optimal comp01_origFor.sol
Comp02.ctt 31 feasable comp02_origFor.sol
Comp03.ctt 42 feasable comp03_origFor.sol
Comp04.ctt 18 optimal comp04_origFor.sol
Comp05.ctt 253 feasable comp05_origFor.sol
Comp06.ctt 16 feasable comp06_origFor.sol
Comp07.ctt 3 optimal comp07_origFor.sol



Results of Comp01-Comp07 instances according to the itc2007 formulation:
Name Value Status Solution
Comp01.ctt 13 feasable comp01_itc2007.sol
Comp02.ctt 43 feasable comp02_itc2007.sol
Comp03.ctt 76 feasable comp03_itc2007.sol
Comp04.ctt 38 feasable comp04_itc2007.sol
Comp05.ctt 314 feasable comp05_itc2007.sol
Comp06.ctt 41 feasable comp06_itc2007.sol
Comp07.ctt 19 feasable comp07_itc2007.sol