n 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.

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

AVELLA P;
2007

Abstract

n 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.
File in questo prodotto:
File Dimensione Formato  
JOH_2007.pdf

non disponibili

Licenza: Non specificato
Dimensione 427 kB
Formato Adobe PDF
427 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12070/4184
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 26
  • ???jsp.display-item.citation.isi??? ND
social impact