Ant algorithms for discrete optimization
Artificial Life
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
Examination Timetabling in British Universities: A Survey
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
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
Parallel ant colony optimization for the traveling salesman problem
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
A novel similarity measure for heuristic selection in examination timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Fuzzy multiple heuristic orderings for examination timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A Developmental Approach to the Uncapacitated Examination Timetabling Problem
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
A multi-objective evolutionary algorithm for examination timetabling
Journal of Scheduling
Constraint-Based Timetabling System for the German University in Cairo
Applications of Declarative Programming and Knowledge Management
Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
The revised developmental approach to the uncapacitated examination timetabling problem
Proceedings of the 2009 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
An informed genetic algorithm for the examination timetabling problem
Applied Soft Computing
Examination timetabling using late acceptance hyper-heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Grasp and Guided Local Search for the examination timetabling problem
International Journal of Artificial Intelligence and Soft Computing
Selection mechanisms in memory consideration for examination timetabling with harmony search
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Information Sciences: an International Journal
A graph coloring constructive hyper-heuristic for examination timetabling problems
Applied Intelligence
Evolutionary algorithms using cluster patterns for timetabling
Intelligent Decision Technologies
| Hi-index | 0.00 |
Scheduling exams at universities can be formulated as a combinatorial optimization problem. Basically one has to schedule a certain number of exams in a given number of time periods so that a predetermined objective function is minimized. In particular, the objective function penalizes schedules where students have to write exams in consecutive periods or even in the same period. Ant colony approaches have been demonstrated to be a powerful solution approach for various combinatorial optimization problems. This paper presents two ant colony approaches for the exam timetabling problem, a Max-Min and an ANTCOL approach. Using the Toronto benchmark test cases from the literature, both algorithms arc compared to other timetabling heuristics. Finally, the Max-Min and ANTCOL algorithms are compared using the same set of test cases. In spite of some shortcomings, the ANTCOL approach turned out to be a worthwhile algorithm, among the best currently in use for examination timetabling.