Research Output

Metaheuristics for university course timetabling.

  In this chapter we consider the NP-complete problem of university
course timetabling. We note that it is often difficult to gain a deep understanding
of these sorts of problems due to the fact that so many different
types of constraints can ultimately be considered for inclusion in any particular
application. Consequently we conduct a detailed analysis of a
benchmark problem version that is slightly simplified, but also contains
many of the features that make these sorts of problems “hard”. We review a
number of the algorithms that have been proposed for this particular problem,
and also present a detailed description and analysis of an example algorithm
that we show is able to perform well across a range of benchmark
instances.

  • Type:

    Book Chapter

  • Date:

    25 April 2007

  • Publication Status:

    Published

  • Publisher

    Springer Berlin / Heidelberg

  • DOI:

    10.1007/978-3-540-48584-1_9

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    006 Special Computer Methods

Citation

Lewis, R. M. R., Paechter, B. & Rossi-Doria, O. (2007). Metaheuristics for university course timetabling. In Dahal, K., Chen Tan, K. & Cowling, P. (Eds.). Evolutionary Scheduling, 237-272. Springer Berlin / Heidelberg. doi:10.1007/978-3-540-48584-1_9. ISBN 978-3-540-48582-7

Authors

Keywords

Metaheuristics; Timetabling

Available Documents