Tools
Tools
Lewis, Rhydian M R, Paechter, Ben and Rossi-Doria, Olivia (2007) Metaheuristics for university course timetabling. In: Evolutionary Scheduling. Studies in Computational Intelligence . Springer Berlin / Heidelberg, pp. 237-272. ISBN 978-3-540-48582-7
Full text not available from this repository. (Request a copy)Abstract/Description
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.
| Item Type: | Book Section |
|---|---|
| ISBN: | 978-3-540-48582-7 |
| Uncontrolled Keywords: | Metaheuristics; Timetabling |
| University Divisions/Research Centres: | Faculty of Engineering, Computing and Creative Industries > School of Computing |
| Dewey Decimal Subjects: | 000 Computer science, information & general works > 000 Computer science, knowledge & systems > 006 Special Computer Methods |
| Library of Congress Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Item ID: | 1767 |
| Depositing User: | RAE Import |
| Date Deposited: | 22 Jul 2008 17:15 |
| Last Modified: | 18 Oct 2010 16:34 |
| URI: | http://researchrepository.napier.ac.uk/id/eprint/1767 |
Actions (login required)
| View Item |