INSPIRING FUTURES

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

Paechter, Ben, Cumming, Andrew and Luchian, Henri (1995) The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms. In: Evolutionary Computing. Lecture Notes in Computer Science, 993 . Springer-Verlag, pp. 86-93. ISBN 978-3-540-60469-3

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

Abstract/Description

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

Item Type: Book Section
ISBN: 978-3-540-60469-3
Electronic ISBN: 978-3-540-47515-6
Additional Information: paper presented at AISB Workshop on Evolutionary Computing
Uncontrolled Keywords: evolutionary algorithms; timetabling; recombination operators;
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: 3206
Depositing User: Computing Research
Date Deposited: 29 Jul 2010 15:39
Last Modified: 04 Jun 2014 11:43
URI: http://researchrepository.napier.ac.uk/id/eprint/3206

Actions (login required)

View Item

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