The combination of evolutionary algorithms with local search was named" memetic
algorithms"(MAs)(Moscato, 1989). These methods are inspired by models of natural systems …

Scheduling lectures or exams for universities is a large and complex task. There are many
different departments and faculties, each with their own ideas about how and when their …

The timetabling problem consists in scheduling a sequence of lectures between teachers
and students in a prefixed period of time (typically a week), satisfying a set of constraints of …

The scheduling of exams in institutions of higher education is known to be a highly
constrained problem. The advent of modularity in many institutions in the UK has resulted in …

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 recent years the processing speed of computers has increased dramatically. This in turn
has allowed search algorithms to execute more iterations in a given amount of real-time …

It is well known that timetabling problems can be very difficult to solve, especially when
dealing with particularly large instances. Finding near-optimal results can prove to be …

Examination timetabling is a well-studied combinatorial optimization problem. We present a
new hybrid algorithm for examination timetabling, consisting of three phases: a constraint …

Microarray techniques are leading to the development of sophisticated algorithms capable
of extracting novel and useful knowledge from a biomedical point of view. In this work, we …

Genetic Algorithms are a class of powerful, robust search techniques based on genetic
inheritance and the Darwinian metaphor of “Natural Selection”. These algorithms maintain a …