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

  • Authors:

  • Pasquale Avella;Bernardo D'Auria;Saverio Salerno;Igor Vasil'Ev

  • Affiliations:

  • RCOST--Research Center on Software Technology, Università di Sannio, Benevento, Italy 82100;Dipartimento di Ingegneria dell'Informazione e Matematica Applicata, Università di Salerno, Fisciano (SA), Italy 84084;Dipartimento di Ingegneria dell'Informazione e Matematica Applicata, Università di Salerno, Fisciano (SA), Italy 84084;Institute of System Dynamics and Control Theory, Siberian Branch of Russian Academy of Sciences, Irkutsk, Russia 664033

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.