Research Output

Application of the Grouping Genetic Algorithm to University Course Timetabling

  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.

  • Date:

    31 December 2005

  • Publication Status:

    Published

  • Publisher

    Springer Berlin Heidelberg

  • DOI:

    10.1007/978-3-540-31996-2_14

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    005 Computer programming, programs & data

Citation

Lewis, R., Lewis, R. M. R., & Paechter, B. (2005). Application of the Grouping Genetic Algorithm to University Course Timetabling. In J. Gottlieb, & G. Raidl (Eds.), Evolutionary Computation in Combinatorial Optimization, 144-153. https://doi.org/10.1007/978-3-540-31996-2_14

Authors

Keywords

University Course Timetabling-Problems; grouping geneticalgorithm;

Monthly Views:

Available Documents