Solving real school timetabling problems with meta-heuristics

  • Authors:
  • F. Melício;P. Caldeira;A. Rosa

  • Affiliations:
  • ISEL, Lisboa, Portugal and LaSEEB-ISR-IST Lisboa, Portugal;EST-IPS, Setúbal, Portugal and LaSEEB-ISR-IST, Lisboa, Portugal;LaSEEB-ISR-IST, Lisboa, Portugal

  • Venue:
  • AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

School timetabling is a classical combinatorial optimization problem, which consists in assigning lessons to time slots, satisfying a set of constraints of various kinds. Due mostly to the constraints this problem falls in the category of NP-Complete problems. In this paper we try to show an implementation of a decision support system that solves real timetabling problems from various schools in Portugal. This implementation is based on the Simulated Annealing meta-heuristic. The constraints we use were obtained after inquiries made to several schools in Portugal. We show the results on three schools from different levels of teaching.