Research Output

Finding feasible timetables using group-based operators.

  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

  • Type:


  • Date:

    01 June 2007

  • Publication Status:


  • Publisher


  • DOI:


  • ISSN:



Lewis, R. M. R. & Paechter, B. (2007). Finding feasible timetables using group-based operators. IEEE Transactions on Evolutionary Computation. 11, 397-413. doi:10.1109/TEVC.2006.885162. ISSN 1089-778X



Group theory; Grouping problems; Fitness functions; Genetic algorithms; Case study; Education; University course timetables;

Monthly Views:

Available Documents

  • pdf

    Finding feasible timetables using group-based operators.pdf


    (c) 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works."

  • Downloadable citations