HGGASA: An Annealing Grouping Genetic Algorithm for Finding Feasible Timetables

摘要

Timetabling is a well-known NP-Complete Constraint Satisfaction problem (CSP) that has been widely studied in the past. In this paper we adopt a modified Genetic Algorithm, better know as Grouping GA and tweaked to suit grouping problems. GGA is further combined with Simulated Annealing (HGGASA) to implement the notion of an acceptance function and improve the performance rate of the algorithm. The results demonstrate a better convergence rate for HGGASA, but not uniformly.