Research Output

An empirical analysis of the Grouping Genetic Algorithm: the timetabling case.

  A grouping genetic algorithm (GGA) for the university course timetabling problem is outlined. We propose six different fitness functions, all sharing the same common goal, and look at the effects that these can have on the algorithm with respect to both solution quality and time requirements. We also propose an additional, stochastic local-search operator and discover that this too can have large positive and negative effects on the runs. As a by-product of these studies, we introduce a method for measuring population diversity with the GGA model and note that diversity seems to have huge consequences on the cost implications of the algorithm. We also witness that the algorithm can behave quite differently with varying sized instances, introducing scaling-up issues that could, quite possibly, apply to grouping genetic algorithms as a whole.

  • Type:

    Book Chapter

  • Date:

    30 November 2004

  • Publication Status:

    Published

  • Publisher

    IEEE Computer Society Press

  • DOI:

    10.1109/CEC.2005.1555053

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    518 Numerical analysis

Citation

Lewis, R. M. R. & Paechter, B. (2004). An empirical analysis of the Grouping Genetic Algorithm: the timetabling case. In 2005 IEEE Congress on Evolutionary Computation, 2856-2863. IEEE Computer Society Press. doi:10.1109/CEC.2005.1555053. ISBN 0-7803-9363-5

Authors

Keywords

Grouping Genetic Algorithm (GGA); timetabling; diversity; local-search operator;

Available Documents