Some experiments with ant colony algorithms for the exam timetabling problem

Authors:
Michael Eley
Affiliations:
Logistics Laboratory (LlAb), Faculty of Engineering, Aschaffenburg University of Applied Science, Aschaffenburg, Germany
Venue:
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Year:
2006

Citing 7
Cited 1

Ant algorithms for discrete optimization

Artificial Life
MAX-MIN Ant system

Future Generation Computer Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Recent Developments in Practical Examination Timetabling

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Tabu Search Techniques for Examination Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
New Algorithms for Examination Timetabling

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Ant algorithms for the university course timetabling problem with regard to the state-of-the-art

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing

A decision support model for scheduling exhibition projects in art museums

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The exam timetabling problem faces the problem of scheduling exams within a limited number of available periods. The main objective is to balance out student’s workload by distributing the exams evenly within the planning horizon. Ant colony approaches have been proven to be a powerful solution approach for various combinatorial optimization problems. In this paper a Max-Min and a ANTCOL approach will be presented. Its performance is compared with other approaches presented in the literature and with modified graph coloring algorithms.