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

Paechter, Ben; Cumming, Andrew; Luchian, Henri

Abstract

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

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

• Conference Name: AISB International Workshop on Evolutionary Computing 1996
• Conference Location: Brighton, UK
• Start Date: Apr 3, 1995
• End Date: Apr 4, 1995
• Publication Date: 1995
• Deposit Date: Jul 29, 2010
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Volume: 993
• Pages: 86-93
• Series Title: Lecture Notes in Computer Science
• Series ISSN: 0302-9743
• Book Title: Evolutionary Computing
• ISBN: 978-3-540-60469-3
• DOI: https://doi.org/10.1007/3-540-60469-3_27
• Keywords: evolutionary algorithms; timetabling; recombination operators
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3206
• Publisher URL: http://dx.doi.org/10.1007/3-540-60469-3_27