A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 550-558 |
Journal / Publication | European Journal of Operational Research |
Volume | 203 |
Issue number | 3 |
Publication status | Published - 16 Jun 2010 |
Link(s)
Abstract
This paper approximately solves the high school timetabling problem using a simulated annealing based algorithm with a newly-designed neighborhood structure. In search for the best neighbor, the heuristic performs a sequence of swaps between pairs of time slots, instead of swapping two assignments as in a standard simulated annealing. The computational results show that the proposed heuristic, which is tested on two sets of benchmark instances, performs better than existing approaches. © 2009 Elsevier B.V. All rights reserved.
Research Area(s)
- Extended neighborhood, Simulated annealing, Timetabling
Citation Format(s)
A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems. / Zhang, Defu; Liu, Yongkai; M'Hallah, Rym; Leung, Stephen C.H.
In: European Journal of Operational Research, Vol. 203, No. 3, 16.06.2010, p. 550-558.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review