Cyclic transfer algorithms for multivehicle routing and scheduling problems
Operations Research
Metaheuristics for High School Timetabling
Computational Optimization and Applications
On a multiconstrained model for chronmatic scheduling
Proceedings of the third international conference on Graphs and optimization
Domination analysis of some heuristics for the traveling salesman problem
Discrete Applied Mathematics
A Survey of Automated Timetabling
Artificial Intelligence Review
Hopfield neural networks for timetabling: formulations, methods, and comparative results
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
A Constructive Evolutionary Approach to School Timetabling
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
DIAGRAMS '02 Proceedings of the Second International Conference on Diagrammatic Representation and Inference
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Modelling Timetabling Problems with STTL
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
New neighborhood search algorithms based on exponentially large neighborhoods
New neighborhood search algorithms based on exponentially large neighborhoods
Recent Metaheuristic Algorithms for the Generalized Assignment Problem
ICKS '04 Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure
School timetabling for quality student and teacher schedules
Journal of Scheduling
Very large-scale neighborhood search techniques in timetabling problems
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A case study for timetabling in a dutch secondary school
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A tiling algorithm for high school timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Local search techniques for large high school timetabling problems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
Operations Research Letters
Hi-index | 0.01 |
In this paper we propose a neighbourhood structure based on sequential/cyclic moves and a cyclic transfer algorithm for the high school timetabling problem. This method enables execution of complex moves for improving an existing solution, while dealing with the challenge of exploring the neighbourhood efficiently. An improvement graph is used in which certain negative cycles correspond to the neighbours; these cycles are explored using a recursive method. We address the problem of applying large neighbourhood structure methods on problems where the cost function is not exactly the sum of independent cost functions, as it is in the set partitioning problem. For computational experiments we use four real world data sets for high school timetabling in the Netherlands and England. We present results of the cyclic transfer algorithm with different settings on these data sets. The costs decrease by 8---28% if we use the cyclic transfers for local optimization compared to our initial solutions. The quality of the best initial solutions are comparable to the solutions found in practice by timetablers.