Pitfalls in instance generation for udine timetabling

Authors:
Leo Lopes;Kate Smith-Miles
Affiliations:
Monash University, School of Mathematics and Statistics, Clayton, VIC, Australia and University of Arizona, Department of Systems and Industrial Engineering, Tucson, AZ;Monash University, School of Mathematics and Statistics, Clayton, VIC, Australia
Venue:
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Year:
2010

Citing 1
Cited 1

New methods to color the vertices of a graph

Communications of the ACM

Generalising algorithm performance in instance space: a timetabling case study

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.