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

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.

This paper describes our work on applying novel techniques based on propositional satisfiability (SAT) solvers and optimizers to the Curriculum-based Course Timetabling problem. Out of 32 standard benchmark instances derived from the Second International Timetabling Competition held in 2007, our techniques yield the best known solutions for 21 of them (19 of them being optimal), improving the p...

The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific institution. This work deals with the problem of the ongoing III International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simula...

[7] G. Lajos. Complete university modular timetabling using constraint logic programming. A constraint-based approach to high-school timetabling problems: A case study. 14 problem diculty is observed. 6 Conclusions We have proposed a constraint satisfaction model for a local high school timetabling problem. The problem we have studied involves an assignment of eight weekly periods to the sectio...

University examination timetabling problems comprise arranging exams in the given number of timeslots through the examination sessions. The primary objective of this process is avoiding of students' clashes (i.e. no one student should take two exams simultaneously). This requirement is generally considered as a hard constraint and should be obligatory satisfied in a feasible timetable. However,...

Timetabling problems are often hard and timeconsuming to solve. Most of the methods of solving them concern only one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems from different domains. The solution is based on evolutionary algorithm’s framework and operates on two levels – first-level evolutionary algorithm tries ...

This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International Timetabling Competition (ITC 2011), which considered many instances from educational institutions around the world and attracted seventeen competitors. Our team, named GOAL (Group of Optimization and Algorithms), developed a solver built...