New crossover operators for timetabling with evolutionary algorithms.

Lewis, Rhydian M R; Paechter, Ben

Abstract

When using an evolutionary algorithm (EA) to optimise a population of feasible course timetables, it is important that the mutation and crossover operators are designed in such a way so that they don?t produce unfeasible or illegal offspring. In this paper we present some specialised, problem specific genetic operators that enable us to do this successfully, and use these in conjunction with a steady state EA to address the University Course Timetabling Problem (UCTP). We introduce a number of different crossover operators, each of which attempts to identify useful building blocks within the timetables, and investigate whether these can be successfully propagated through the population to encourage the production of high quality solutions. We test the effectiveness of these crossover operators on twenty well-known problem instances and present the results found. Whilst the results are not state-of-the-art, we make some interesting observations on the nature of the various crossover operators and the effects that they have on the evolution of the population as a whole

Citation

Lewis, R. M. R., & Paechter, B. (2004, December). New crossover operators for timetabling with evolutionary algorithms

• Start Date: Dec 16, 2004
• End Date: Dec 18, 2004
• Publication Date: 2004
• Deposit Date: Apr 23, 2010
• Publicly Available Date: Apr 23, 2010
• Peer Reviewed: Peer Reviewed
• Volume: 5
• Pages: 189-195
• Book Title: 5th International Conference on Recent Advances in Soft Computing
• ISBN: 1-84233-110-8
• Keywords: Genetic algorithms; evolutionary computation; timetabling; scheduling; optimisation
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3400
• Contract Date: Apr 23, 2010