Application of the grouping genetic algorithm to university course timetabling
R Lewis, B Paechter - European conference on evolutionary computation …, 2005 - Springer
European conference on evolutionary computation in combinatorial optimization, 2005•Springer
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 …
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 …
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.
Springer
Showing the best result for this search. See all results