A simulated annealing algorithm for university course timetabling considering travelling distances Online publication date: Sun, 17-May-2015
by Shuang Zheng; Long Wang; Yueyue Liu; Rui Zhang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 2, 2015
Abstract: This paper addresses the curriculum-based course timetabling problem (CB-CCT) with extra travelling distance constraints using an improved simulated annealing algorithm. The motivation of considering the new constraints is that the travelling distances between two consecutive lectures attended by the same group of students must be controlled into a certain range in order to facilitate on-campus transportation. We propose a two-stage solution method, which circumvents the hard constraints violations firstly, and minimises the soft constraints violations subsequently. To obtain satisfactory solutions, an improved simulated annealing algorithm with memory function (ISAM) is adopted, which incorporates a variety of space adjustment and time adjustment strategies as the local search module. We study the impact of the initial solution, the annealing strategy, and the search depth of ISAM on the final solution quality. The computational results show that the improved simulated annealing algorithm can solve the course timetabling problem effectively.
Online publication date: Sun, 17-May-2015
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com