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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Müller, T.: Itc 2007 solver description: A hybrid approach. In: Proceedings of the Seventh PATAT Conference (2008)
Gaspero, L.D., McCollum, B., Schaerf, A.: The second international timetabling competition (itc-2007): Curriculum-based course timetabling (track 3). Technical report, DIEGM, University of Udine (2007)
Cesco, F.D., Gaspero, L.D., Schaerf, A.: Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results. In: Proceedings of the Seventh PATAT Conference (2008)
Burke, E.K., Mareček, J., Parkes, A.J., Rudová, H.: A supernodal formulation of vertex colouring with applications in course timetabling. Technical Report NOTTCS-TR-2007-10, The University of Nottingham, Nottingham (2007)
Smith-Miles, K., Lopes, L.: Measuring combinatorial optimization problem difficulty for algorithm selection (submitted, 2010)
Beyrouthy, C., Burke, E., McCollum, B., McMullan, P., Parkes, A.: Enrollment generators, clustering and chromatic numbers. In: Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008), Montreal, Canada (2008)
Kostuch, P., Socha, K.: Hardness prediction for the university course timetabling problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 135–144. Springer, Heidelberg (2004)
Brélaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22(4), 256 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lopes, L., Smith-Miles, K. (2010). Pitfalls in Instance Generation for Udine Timetabling. In: Blum, C., Battiti, R. (eds) Learning and Intelligent Optimization. LION 2010. Lecture Notes in Computer Science, vol 6073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13800-3_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-13800-3_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13799-0
Online ISBN: 978-3-642-13800-3
eBook Packages: Computer ScienceComputer Science (R0)