Finding Feasible Timetables Using Group-Based Operators

Abstract

This paper describes the applicability of the so-called "grouping genetic algorithm" to a well-known version of the university course timetabling problem. We note that there are, in fact, various scaling up issues surrounding this sort of algorithm and, in particular, see that it behaves in quite different ways with different sized problem instances. As a by-product of these investigations, we introduce a method for measuring population diversities and distances between individuals with the grouping representation. We also look at how such an algorithm might be improved: first, through the introduction of a number of different fitness functions and, second, through the use of an additional stochastic local-search operator (making in effect a grouping memetic algorithm). In many cases, we notice that the best results are actually returned when the grouping genetic operators are removed altogether, thus highlighting many of the issues that are raised in the study

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 65 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.