Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 203, Issue 3, Pages 550-558Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2009.09.014
Keywords
Timetabling; Simulated annealing; Extended neighborhood
Funding
- National Nature Science Foundation of China [60773126]
- Province Nature Science Foundation of Fujian
- academician start-up fund [X01109]
- 985 information technology fund [0000-X07204]
- Kuwait University [US01/06]
Ask authors/readers for more resources
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. (C) 2009 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available