A computational study of local search algorithms for Italian high-school timetabling

In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy "hard" requirements, that are mandatory, and should minimize the violation of "soft" constraints. In our approach, we combine Sim...

Full description

Saved in:
Bibliographic Details
Published in:Journal of heuristics 2007-12, Vol.13 (6), p.543-556
Main Authors: Avella, Pasquale, D’Auria, Bernardo, Salerno, Saverio, Vasil’ev, Igor
Format: Article
Language:English
Subjects:
Algorithms
Control theory
Curricula
Integer programming
Neighborhoods
Scheduling algorithms
Schools
Studies
Teachers
Workloads
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy "hard" requirements, that are mandatory, and should minimize the violation of "soft" constraints. In our approach, we combine Simulated Annealing with a Very Large-Scale Neighborhood search where the neighborhood is explored by solving an Integer Programming problem. We report on a computational experience validating the usefulness of the proposed approach. [PUBLICATION ABSTRACT]
ISSN:1381-1231
1572-9397
DOI:10.1007/s10732-007-9025-3