Evolutionary algorithms for timetable problems
Abstract
The university course timetabling problem is hard and time-consuming to solve. Profits from full automatisation of this process can be invaluable. This paper describes architecture and operation of two automatic timetabling systems. Both are based on evolutionary algorithms, with specialised genetic operators and penalty-based evaluation function. The paper covers two problem variations (theorethical and real-world), with different sets of constraints and different representations. Moreover, specification of both solutions and a proposal of hybrid system architecture is included.
Full Text:
PDFDOI: http://dx.doi.org/10.17951/ai.2003.1.1.1-9
Date of publication: 2015-01-04 00:00:00
Date of submission: 2016-04-27 10:10:08
Statistics
Total abstract view - 378
Downloads (from 2020-06-17) - PDF - 0
Indicators
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Annales UMCS Sectio AI Informatica
This work is licensed under a Creative Commons Attribution 4.0 International License.