Citation
An Investigation Of Variable Neighbourhood Search For University Course Timetabling. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 413-427, 2005.
Paper
Abstract
The university course timetabling problem consists, in essence, of assigning lectures to a specific timeslot and room. The goal is to satisfy as many soft constraints as possible while constructing a feasible schedule. In this paper, we present a variable neighbourhood search approach with an exponential monte carlo acceptance criteria. This heuristic search approach is based on random-descent local search. The solution returned after exploring a neighbourhood structure is accepted based on the exponential monte carlo criteria. The approach is tested over eleven established datasets. The results demonstrate that the variable neighbourhood search approach is able to produce solutions that are competitive with state-of-the-art techniques from the literature.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2005-413-427-P, author = {S. Abdullah and E. K. Burke and B. McCollum},
title = {An Investigation Of Variable Neighbourhood Search For University Course Timetabling},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. Pinedo},
pages = {413--427},
note = {Paper},
abstract = {The university course timetabling problem consists, in essence, of assigning lectures to a specific timeslot and room. The goal is to satisfy as many soft constraints as possible while constructing a feasible schedule. In this paper, we present a variable neighbourhood search approach with an exponential monte carlo acceptance criteria. This heuristic search approach is based on random-descent local search. The solution returned after exploring a neighbourhood structure is accepted based on the exponential monte carlo criteria. The approach is tested over eleven established datasets. The results demonstrate that the variable neighbourhood search approach is able to produce solutions that are competitive with state-of-the-art techniques from the literature.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-413-427-P.pdf} }