The Second International Timetabling Competition (TTC2007) opened in August 2007.
Building on the success of the first competition in 2002, this sequel aimed to further develop …

Since university timetabling is commonly classified as a combinatorial optimisation problem,
researchers tend to use optimisation approaches to reach the optimal timetable solution …

The timetabling problem involves the scheduling of a set of entities (eg, lectures, exams,
vehicles, or people) to a set of resources in a limited number of time slots, while satisfying a …

In this paper, we investigate variable neighbourhood search (VNS) approaches for the
university examination timetabling problem. In addition to a basic VNS method, we introduce …

Hyper-heuristics are search methodologies that aim to provide high-quality solutions across
a wide variety of problem domains, rather than develo** tailor-made methodologies for …

Feature selection methods are used to identify and remove irrelevant and redundant
attributes from the original feature vector that do not have much contribution to enhance the …

In this work we investigate a new graph coloring constructive hyper-heuristic for solving
examination timetabling problems. We utilize the hierarchical hybridizations of four low level …

Designing generic problem solvers that perform well across a diverse set of problems is a
challenging task. In this work, we propose a hyper-heuristic framework to automatically …

Swarm intelligence is a branch of artificial intelligence that focuses on the actions of agents
in self-organized systems. Researchers have proposed a bee colony optimization (BCO) …

Finding a good university timetabling system is not a simple task for a higher educational
organisation. As a result, many approaches to generating sufficiently good solutions have …