A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
Publication Type
Journal Article
Version
publishedVersion
Publication Date
1-2012
Abstract
This paper describes a timetabling problem at universities, where a master course timetable is given extrinsically and conflicts due to students' course enrollment do not need to be considered. A solver for the problem, which integrates both teacher assignment and course scheduling, is described. An initial solution is obtained by a mathematical programming approach based on Lagrangian relaxation. This solution is further improved by a simulated annealing algorithm. The proposed method has been tested on instances from a university in Indonesia, as well as on several randomly generated datasets, and the corresponding computational results are reported.
Keywords
Timetabling, Mathematical programming, Lagrangian relaxation, Simulated annealing
Discipline
Programming Languages and Compilers | Software Engineering
Research Areas
Intelligent Systems and Optimization
Publication
Computers and Operations Research
Volume
39
Issue
12
First Page
3074
Last Page
3088
ISSN
0305-0548
Identifier
10.1016/j.cor.2012.03.011
Publisher
Elsevier
Citation
GUNAWAN, Aldy and POH, Kim Leng.
A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem. (2012). Computers and Operations Research. 39, (12), 3074-3088.
Available at: https://ink.library.smu.edu.sg/sis_research/3983
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1016/j.cor.2012.03.011