We consider a simplification of a typical university course timetabling problem involving three types of hard and three types of soft constraints. A MAX-MIN Ant System, which makes use of a separate local search routine, is proposed for tackling this problem. We devise an appropriate construction graph and pheromone matrix representation after considering… (More)
In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatorial optimization, can be adapted to continuous optimization without any major conceptual change to its structure. We present the general idea, implementation, and results obtained.… (More)
The university course timetabling problem is an optimisation problem in which a set of events has to be scheduled in timeslots and located in suitable rooms. Recently, a set of benchmark instances was introduced and used for an 'International Timetabling Competition' to which 24 algorithms were submitted by various research groups active in the field of… (More)
Published as a chapter in Approximation Algorithms and Metaheuristics, a book edited by T. F. Gonzalez.
Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented – Ant Colony System and MAX-MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine (or… (More)
This work presents a new evolutionary approach to searching for a global solution (in the Pareto sense) to multiob-jective optimisation problem. Novelty of the method proposed consists in the application of an evolutionary multi-agent system (EMAS) instead of classical evolutionary algorithms. Decen-tralisation of the evolution process in EMAS allows for… (More)