Some observations about GA-based exam timetabling.

Ross, Peter; Hart, Emma; Corne, Dave

Abstract

Although many people have tried using genetic algorithms (GAs) for exam timetabling, far fewer have done systematic investigations to try to determine whether a GA is a good choice of method or not. We have extensively studied GAs that use one particular kind of direct encoding for exam timetabling. Perhaps not surprisingly, it emerges that this approach is not very good, but it is instructive to see why. In the course of this investigation we discovered a class of solvable problems with interesting properties: our GAs would sometimes fail to solve some of the moderately-constrained problems, but could solve all of the lightly-constrained ones and all of the highly-constrained ones. This is despite the fact that they form a hierarchy: those erratically-solved problems are subproblems of the easily-solved but highly-constrained ones. Moreover, some other non-evolutionary approaches also failed on precisely the same sets. This, together with some observations about much simpler graph-colouring methods based on the Brelaz algorithm, suggest some future directions for GA-based methods.

Citation

Ross, P., Hart, E., & Corne, D. (1998). Some observations about GA-based exam timetabling. In E. Burke, & M. Carter (Eds.), Practice and Theory of Automated Timetabling II (115-129)

• Presentation Conference Type: Conference Paper (Published)
• Conference Name: Second International Conference, PATAT’97
• Start Date: Aug 20, 1997
• End Date: Aug 22, 1997
• Publication Date: 1998
• Deposit Date: Sep 1, 2010
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Volume: 1408
• Pages: 115-129
• Series Title: Lecture Notes in Computer Science
• Series Number: 1408
• Series ISSN: 0302-9743
• Book Title: Practice and Theory of Automated Timetabling II
• ISBN: 3 540 64979 4
• Keywords: genetic algorithms; exam timetabling; direct encoding; sub-problems
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3176