论文信息 - Pitfalls in Instance Generation for Udine Timetabling

Pitfalls in Instance Generation for Udine Timetabling

In many randomly generated instances for Udine timetabling very different solvers achieved the same objective value (with different solutions). This paper summarises observations concerning the structure of the instances and their consequences for effective test instance generation and reporting of computational results in Udine Timetabling problems.

Kate Smith-Miles | Leo Lopes

[1] Luca Di Gaspero,et al. Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results , 2012, Ann. Oper. Res..

[2] Edmund K. Burke,et al. A supernodal formulation of vertex colouring with applications in course timetabling , 2007, Ann. Oper. Res..

[3] Tomás Müller,et al. ITC2007 solver description: a hybrid approach , 2009, Ann. Oper. Res..

[4] Jens Gottlieb,et al. Evolutionary Computation in Combinatorial Optimization , 2006, Lecture Notes in Computer Science.

[5] Krzysztof Socha,et al. Hardness Prediction for the University Course Timetabling Problem , 2004, EvoCOP.

[6] Barry McCollum,et al. The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3) — preliminary presentation — , 2007 .

[7] Edmund K. Burke,et al. Enrollment generators, clustering and chromatic numbers , 2008 .

[8] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.