Genetic algorithms and timetabling

  • Authors:

  • Peter Ross;Emma Hart;Dave Corne

  • Affiliations:

  • Division of Informatics, University of Edinburgh, 80 South Bridge, Edinburgh EH1 1HN, UK and School of Computing, Napier University, 219 Colinton Road, Edinburgh EH14 1DJ, UK;Division of Informatics, University of Edinburgh, 80 South Bridge, Edinburgh EH1 1HN, UK and School of Computing, Napier University, 219 Colinton Road, Edinburgh EH14 1DJ, UK;Department of Computer Science, University of Reading, Whiteknights, Reading RG6 6AY, UK

  • Venue:
  • Advances in evolutionary computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This chapter discusses the state of the art, at the start of the new millennium, in using evolutionary algorithms to tackle timetabling problems of various kinds. Timetabling problems are interesting because they are often regarded as difficult examples of problems which mix hard and soft constraints, and yet huge numbers of practical instances need to be tackled somehow.A variety of representations and algorithms have been used, but there is still a need for more wide-ranging scientific study to compare different approaches. Most authors merely report success of some kind on the problems that occur at their own institutions.