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 journalpeer-review

65 Scopus Citations
View graph of relations

Author(s)

  • Defu Zhang
  • Yongkai Liu
  • Rym M'Hallah
  • Stephen C.H. Leung

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)550-558
Journal / PublicationEuropean Journal of Operational Research
Volume203
Issue number3
Publication statusPublished - 16 Jun 2010

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 journalpeer-review