The study of differences between timetabling research presented in conferences like PATAT
or published in Annals of OR and commercial timetabling software used in Higher Education …

The term 'Memetic Algorithms'[74](MAs) was introduced in the late 80s to denote a family of
metaheuristics that have as central theme the hybridization of different algorithmic …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Hyper-heuristics can be identified as methodologies that search the space generated by a
finite set of low level heuristics for solving search problems. An iterative hyper-heuristic …

We present a memetic approach for multi-objective improvement of robustness influencing
features (called robustness objectives) in airline schedules. Improvement of the objectives is …

Automating the neighbourhood selection process in an iterative approach that uses multiple
heuristics is not a trivial task. Hyper-heuristics are search methodologies that not only aim to …

A hyperheuristic is a high level problem solving methodology that performs a search over
the space generated by a set of low level heuristics. One of the hyperheuristic frameworks is …

Ontologies are recognized as a fundamental component for enabling interoperability across
heterogeneous systems and applications. Indeed, they try to fit a common understanding of …

In this paper, we address the issue of ordering events by simultaneously considering three
separate heuristics using fuzzy methods. Combinations of the following three heuristic …

There are several characteristics that make scheduling and timetabling problems particularly
difficult to solve: they have huge search spaces, they are often highly constrained, they …