@article{842c81cd21e449918a0b6d390c913d98,
title = "A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems",
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.",
keywords = "Extended neighborhood, Simulated annealing, Timetabling",
author = "Defu Zhang and Yongkai Liu and Rym M'Hallah and Leung, {Stephen C.H.}",
note = "Funding Information: The authors thank the anonymous referees for their invaluable comments and thank C.N. Moschopoulos, G.N. Beligiannis, and K. Papoutsis for providing them with the benchmark sets. This work was supported by the National Nature Science Foundation of China (Grant No. 60773126 ), the Province Nature Science Foundation of Fujian (Grant No. A0710023 ), the academician start-up fund (Grant No. X01109 ), and the 985 information technology fund (Grant No. 0000-X07204 ) in Xiamen University. The first author is grateful for their support. This research was partially supported under Kuwait University Research Grant US01/06 . The third author is grateful for their support. Copyright: Copyright 2009 Elsevier B.V., All rights reserved.",
year = "2010",
month = jun,
day = "16",
doi = "10.1016/j.ejor.2009.09.014",
language = "English",
volume = "203",
pages = "550--558",
journal = "EUROPEAN JOURNAL OF OPERATIONAL RESEARCH",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",
}