Timetabling the classes of an entire university with an evolutionary algorithm.

Paechter, Ben, Rankin, Bob, Cumming, Andrew and Fogarty, Terence C (1998) Timetabling the classes of an entire university with an evolutionary algorithm. In: Parallel Problem Solving from Nature - PPSN V. Lecture Notes in Computer Science, 1498 . Springer-Verlag, pp. 865-874. ISBN 978-3-540-65078-2

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


This paper describes extensions to an evolutionary algorithm that timetables classes for an entire University. A new method of dealing with multi-objectives is described along with a user interface designed for it. New results are given concerning repair of poor recombination choices during local search. New methods are described and evaluated that allow timetables to be produced which have minimal changes compared to a full or partial reference timetable. The paper concludes with a discussion of scale-up issues, and gives some initial results that are very encouraging.

Item Type: Book Section
ISBN: 978-3-540-65078-2
Electronic ISBN: 978-3-540-49672-4
Uncontrolled Keywords: evolutionary algorithm; multi-objectives; scale-up issues;
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: 3207
Depositing User: Computing Research
Date Deposited: 29 Jul 2010 14:39
Last Modified: 15 May 2014 15:13

Actions (login required)

View Item View Item

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