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

Research Output

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.

Date:

31 December 1998
Publication Status:

Published
Publisher

Springer-Verlag
DOI:

10.1007/BFb0056928
Library of Congress:

QA75 Electronic computers. Computer science
Dewey Decimal Classification:

005 Computer programming, programs & data

http://researchrepository.napier.ac.uk/output/285078 <p>Paechter, B., Rankin, B., Cumming, A., & Fogarty, T. C. (1998). Timetabling the classes of an entire university with an evolutionary algorithm. In T. Beck, & M. Schoenauer (Eds.), <i>Parallel Problem Solving from Nature - PPSN V</i>. , (865-874). https://doi.org/10.1007/BFb0056928</p>

Citation

Paechter, B., Rankin, B., Cumming, A., & Fogarty, T. C. (1998). Timetabling the classes of an entire university with an evolutionary algorithm. In T. Beck, & M. Schoenauer (Eds.), Parallel Problem Solving from Nature - PPSN V. , (865-874). https://doi.org/10.1007/BFb0056928