Application of the grouping genetic algorithm to university course timetabling

Authors:
Rhydian Lewis;Ben Paechter
Affiliations:
Centre for Emergent Computing, Napier University, Edinburgh, UK;Centre for Emergent Computing, Napier University, Edinburgh, UK
Venue:
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2005

Citing 12
Cited 5

A robust simulated annealing based examination timetabling system

Computers and Operations Research
A grouping genetic algorithm for coloring the edges of graphs

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Genetic Algorithms and Grouping Problems

Genetic Algorithms and Grouping Problems
Practical Handbook of Genetic Algorithms

Practical Handbook of Genetic Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics
A Survey of Automated Timetabling

Artificial Intelligence Review
Solving Equal Piles with the Grouping Genetic Algorithm

Proceedings of the 6th International Conference on Genetic Algorithms
A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A MAX-MIN Ant System for the University Course Timetabling Problem

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Specialised Recombinative Operators for Timetabling Problems

Selected Papers from AISB Workshop on Evolutionary Computing
A new representation and operators for genetic algorithms applied to grouping problems

Evolutionary Computation

An Efficient Simulated Annealing Algorithm for Feasible Solutions of Course Timetabling

MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Polynomial reduction of time-space scheduling to time scheduling

Discrete Applied Mathematics
Review: Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem

Computers and Operations Research
Efficient citywide planning of open WiFi access networks using novel grouping harmony searchheuristics

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constraints and, as much as possible, some soft constraints. Here we work with a well-known version of the problem where there seems a strong case for considering these two goals as separate sub-problems. In particular we note that the satisfaction of hard constraints fits the standard definition of a grouping problem. As a result, a grouping genetic algorithm for finding feasible timetables for “hard” problem instances has been developed, with promising results.