This technical report focuses on a concrete instance of the real-life employee timetabling problem presented in the paper “Applying CP(FD), CLP(FD) and CFLP(FD) to a Real-Life Employee Timetabling Problem”. It provides additional material that would help the reader of the paper in both understanding the algorithm proposed as well as the code of the models provided online.

The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present t...

This paper concerns the domain of the multimodal transportation systems composed of buses, trains, trams and subways lines and focuses on the scheduling problems encountered in these systems. Transportation Network Infrastructure (TNI) can be modeled as a network of lines providing cyclic routes for particular kinds of stream-like moving transportation means. Lines are connected by common share...

University timetabling problems are a yearly challenging task and faced repeatedly each semester. The considered non-polynomial time (NP) combinatorial optimization (COP), which means that they can be solved through algorithms to produce the aspired optimal timetable. Several techniques have been used solve university problems, most of them use techniques. This paper provides comprehensive revi...

This paper is the organizers’ report on the Third International Timetabling Competition (ITC2011), run during the first half of 2012. Its participants tackled 35 instances of the high school timetabling problem, taken from schools in 10 countries.

There is a variety of approaches developed by researchers to solve different instances of timetabling problems. During these studies different data formats are used to represent a timetabling problem instance and its solution, causing difficulties in the evaluation and comparison of approaches and sharing data. In this paper, a model for timetabling problems and a new data format for them based...

Research in the domain of school timetabling has essentially focused on applying various techniques such as integer programming, constraint satisfaction, simulated annealing, tabu search and genetic algorithms to calculate a solution to the problem. Optimization techniques like simulated annealing, tabu search and genetic algorithms generally explore a solution space. Hyper-heuristics, on the o...

Although there has been a fair amount of research in the area of school timetabling, this domain has not developed as well as other fields of educational timetabling such as university course and examination timetabling. This can possibly be attributed to the fact that the studies in this domain have generally been conducted in isolation of each other and have addressed different school timetab...

An integer program and a hybrid genetic algorithm for the university timetabling problem Xuehao Feng, Yuna Lee & Ilkyeong Moon To cite this article: Xuehao Feng, Yuna Lee & Ilkyeong Moon (2017) An integer program and a hybrid genetic algorithm for the university timetabling problem, Optimization Methods and Software, 32:3, 625-649, DOI: 10.1080/10556788.2016.1233970 To link to this article: htt...

We present here a metaheuristic approach to the university course timetabling problem using a memetic algorithm with a very effective local search. The algorithm was tested on the International Timetabling Competition benchmark instances. Results are encouraging and show that evolutionary computation with the help of local search can compete with succesful algorithms on the problem.