A simulated annealing algorithm with a new neighborhood structure for the timetabling problem

Authors:
Yongkai Liu;Defu Zhang;Stephen C.H. Leung
Affiliations:
Xiamen University, Xiamen, China;Xiamen University, Xiamen, China;City University of Hong Kong, Hong Kong, Hong Kong
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 6
Cited 1

Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
Hopfield neural networks for timetabling: formulations, methods, and comparative results

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
The Complexity of Timetable Construction Problems

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A MAX-MIN Ant System for the University Course Timetabling Problem

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Applying evolutionary computation to the school timetabling problem: The Greek case

Computers and Operations Research
The university course timetabling problem with a three-phase approach

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling

Academic course scheduling by simulated annealing

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new neighborhood structure is presented. The new neighborhood is obtained by performing a sequence of swaps between two timeslots, instead of only one move in the standard neighborhood structure. Based on new neighborhood, simulated annealing algorithm can solve the timetabling problem well. The computation results on two open benchmarks coming from two real-world high schools timetabling problems prove that the simulated annealing algorithm based on new neighborhood can compete with other effective approaches.