A multistage evolutionary algorithm for the timetable problem

It is well known that timetabling problems can be very difficult to solve, especially when dealing with particularly large instances. Finding near-optimal results can prove to be extremely difficult, even when using advanced search methods such as evolutionary algorithms (EAs). The paper presents a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on evolutionary computation 1999-04, Vol.3 (1), p.63-74
Main Authors: Burke, E.K., Newall, J.P.
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Dealing
Evolutionary algorithms
Evolutionary computation
Exact sciences and technology
Extreme values
Genetic algorithms
Handles
Mathematical models
Memory and file management (including protection and security)
Memory organisation. Data processing
Multistage
Processor scheduling
Search methods
Simulated annealing
Software
Theoretical computing
Timetables
Citations: Items that this one cites
Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is well known that timetabling problems can be very difficult to solve, especially when dealing with particularly large instances. Finding near-optimal results can prove to be extremely difficult, even when using advanced search methods such as evolutionary algorithms (EAs). The paper presents a method of decomposing larger problems into smaller components, each of which is of a size that the EA can effectively handle. Various experimental results using this method show that not only can the execution time be considerably reduced but also that the presented method can actually improve the quality of the solutions.
ISSN:1089-778X
1941-0026
DOI:10.1109/4235.752921