Optimising a Presentation Timetable Using Evolutionary Algorithms

Paechter, Ben (1994) Optimising a Presentation Timetable Using Evolutionary Algorithms. In: Evolutionary Computing. Lecture Notes in Computer Science, 865 . Springer-Verlag, pp. 264-276. ISBN 978-3-540-58483-4

Full text not available from this repository. (Request a copy)


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.

Item Type: Book Section
ISBN: 978-3-540-58483-4
Electronic ISBN: 978-3-540-48999-3
Uncontrolled Keywords: evolutionary algorithms; timetabling;
University Divisions/Research Centres: Faculty of Engineering, Computing and Creative Industries > School of Computing
Dewey Decimal Subjects: 000 Computer science, information & general works > 000 Computer science, knowledge & systems > 005 Computer programming, programs & data
Library of Congress Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Item ID: 3205
Depositing User: Computing Research
Date Deposited: 30 Jul 2010 14:37
Last Modified: 04 Jun 2014 12:17

Actions (login required)

View Item View Item

Edinburgh Napier University is a registered Scottish charity. Registration number SC018373