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

DOI10.1007/s10732-007-9025-3zbMath1144.90451OpenAlexW1969426100MaRDI QIDQ930154

Pasquale Avella, Saverio Salerno, Bernardo D'auria, Igor' Leonidovich Vasilyev

Publication date: 23 June 2008

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-007-9025-3

zbMATH Keywords

Simulated annealingSchool timetablingVery large scale neighborhood search

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A two-stage decomposition of high school timetabling applied to cases in Denmark ⋮ A fix-and-optimize heuristic for the high school timetabling problem ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ High quality timetables for Italian schools ⋮ Integer programming for the generalized high school timetabling problem ⋮ MIP heuristics for a resource constrained project scheduling problem with workload stability constraints ⋮ A survey of school timetabling research ⋮ Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem ⋮ Merging Variables: One Technique of Search in Pseudo-Boolean Optimization ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A survey of very large-scale neighborhood search techniques
• An introduction to timetabling
• The combinatorics of timetabling
• Metaheuristics for high school timetabling
• Recent research directions in automated timetabling
• Complexity of some special types of timetabling problems
• A generalized class-teacher model for some timetabling problems
• Practice and theory of automated timetabling III. 3rd international conference, PATAT 2000, Konstanz, Germany, August 16--18, 2000. Selected papers
• A general meta-heuristic based solver for combinatorial optimisation problems