The university course timetabling problem with a three-phase approach

Authors:
Philipp Kostuch
Affiliations:
Department of Statistics, Oxford University, Oxford, UK
Venue:
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Year:
2004

Citing 9
Cited 15

A robust simulated annealing based examination timetabling system

Computers and Operations Research
Timetable planning using the constraint-based reasoning

Computers and Operations Research
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
Timetabling the Classes of an Entire University with an Evolutionary Algorithm

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Recent Developments in Practical Course Timetabling

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Some Observations about GA-Based Exam Timetabling

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Tabu Search Techniques for Examination Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A MAX-MIN Ant System for the University Course Timetabling Problem

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms

A Computational Study of a Cutting Plane Algorithm for University Course Timetabling

Journal of Scheduling
An effective hybrid algorithm for university course timetabling

Journal of Scheduling
An Efficient Simulated Annealing Algorithm for Feasible Solutions of Course Timetabling

MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Polynomial reduction of time-space scheduling to time scheduling

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

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition

INFORMS Journal on Computing
Measurability and reproducibility in university timetabling research: discussion and proposals

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Complex university course timetabling

Journal of Scheduling
Towards a deterministic model for course timetabling

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Analytically tuned parameters of simulated annealing for the timetabling problem

CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Chemical signaling as a useful metaphor for resource management

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem

Computers and Operations Research
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice

Journal of Scheduling
Solving the International Timetabling Competition: a Deterministic Approach

Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
On the performance of Scatter Search for post-enrolment course timetabling problems

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the University Course Timetabling Problem (UCTP) used in the International Timetabling Competition 2003 organized by the Metaheuristics Network and presents a state-of-the-art heuristic approach towards the solution of the competition instances. It is a greatly improved version of the winning competition entry. The heuristic is divided into three phases: at first, a feasible timetable is constructed, then Simulated Annealing (SA) is used to order the thus created time-slots optimally, and finally SA is used to swap individual events between time-slots to improve the solution quality.