The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms.

Research Output

This paper presents a new genetic representation for timetabling with evolutionary algorithms. The representation involves the use of suggestion lists for the placement of events into timeslots. A set of recombination operators is defined for the new representation, and experimental results are given to compare the performance of the operators with each other and with a system not using suggestion lists

Date:

31 December 1995
Publication Status:

Published
Publisher

Springer-Verlag
DOI:

10.1007/3-540-60469-3_27
Library of Congress:

QA75 Electronic computers. Computer science
Dewey Decimal Classification:

005 Computer programming, programs & data

http://researchrepository.napier.ac.uk/output/290087 <p>Paechter, B., Cumming, A., & Luchian, H. (1995). The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms. In <i>Evolutionary Computing</i>, 86-93. https://doi.org/10.1007/3-540-60469-3_27</p>

Citation

Paechter, B., Cumming, A., & Luchian, H. (1995). The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms. In Evolutionary Computing, 86-93. https://doi.org/10.1007/3-540-60469-3_27