Optimising a Presentation Timetable Using Evolutionary Algorithms

Paechter, Ben

Abstract

This paper describes a solution to the problem of scheduling student presentations which uses evolutionary algorithms. The solution uses a permutation based approach with each candidate schedule being coded for by a genotype containing six chromosomes. Five systems (chromosome representation and genetic operators) are described and their suitability assessed for this application. Three of the systems use direct representations of permutations, the other two use indirect representations. Experimental results with different fitness equations, operator rates and population and replacement strategies are also given. All the systems are shown to be good at solving the problem if the algorithm parameters are correct. The best parameters for each system are given along with those parameters that do particularly badly.

• Presentation Conference Type: Conference Paper (Published)
• Conference Name: AISB EC: AISB Workshop on Evolutionary Computing
• Start Date: Apr 11, 1994
• End Date: Apr 13, 1994
• Publication Date: 1994
• Deposit Date: Jul 30, 2010
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Pages: 264-276
• Series Title: Lecture Notes in Computer Science
• Series Number: 865
• Book Title: Evolutionary Computing
• ISBN: 978-3-540-58483-4
• DOI: https://doi.org/10.1007/3-540-58483-8_20
• Keywords: evolutionary algorithms; timetabling
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3205
• Publisher URL: http://dx.doi.org/10.1007/3-540-58483-8_20