A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems

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 a...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2010-06, Vol.203 (3), p.550-558
Main Authors: Zhang, Defu, Liu, Yongkai, M’Hallah, Rym, Leung, Stephen C.H.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Extended neighborhood
Heuristic
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Scheduling, sequencing
School schedules
Secondary schools
Simulated annealing
Studies
Timetabling
Timetabling Simulated annealing Extended neighborhood
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2009.09.014