Strong bounds with cut and column generation for class-teacher timetabling

@article{Santos2012StrongBW,
  title={Strong bounds with cut and column generation for class-teacher timetabling},
  author={Haroldo G. Santos and Eduardo Uchoa and Luiz Satoru Ochi and Nelson Maculan},
  journal={Annals of Operations Research},
  year={2012},
  volume={194},
  pages={399-412}
}
This work presents an integer programming formulation for a variant of the Class-Teacher Timetabling problem, which considers the satisfaction of teacher preferences and also the proper distribution of lessons throughout the week. The formulation contains a very large number of variables and is enhanced by cuts. Therefore, a cut and column generation algorithm to solve its linear relaxation is provided. The lower bounds obtained are very good, allowing us to prove the optimality of previously… 
VNS BASED ALGORITHMS TO THE HIGH SCHOOL TIMETABLING PROBLEM
TLDR
An investigation on the development of a Variable Neighborhood Search (VNS) method which includes two powerful neighborhood operators to heuristically solve the high school timetabling problem.
A column generation approach to high school timetabling modeled as a multicommodity flow problem
SOLVING THE HIGH SCHOOL TIMETABLING PROBLEM TO OPTIMALITY BY USING ILS ALGORITHMS
TLDR
Three Iterated Local Search algorithms which includes two newly proposed neighborhood operators to heuristically solve a benchmark of the high school timetabling problem from literature, showing that these methods are effective and efficient to solve the problem.
Constraint Programming for High School Timetabling: A Scheduling-Based Model with Hot Starts
TLDR
This paper forms a novel CP model for HSTT using a scheduling-based point of view and shows that a drastic improvement in performance can be achieved by including solution-based phase saving, which directs the CP solver to first search in close proximity to the best solution found, and the hot start approach, where it uses existing heuristic methods to produce a starting point for theCP solver.
THE IMPACT OF COMPACTNESS REQUIREMENTS ON THE RESOLUTION OF HIGH SCHOOL TIMETABLING PROBLEM
TLDR
This work explores the influence of four different idle times constraint formulations: two of them were previously proposed, and two are novel, and one of them is new best computed solutions.
Integer programming for the generalized high school timetabling problem
TLDR
This paper describes the first exact method capable of handling an arbitrary instance of the XHSTT format based on a mixed-integer linear programming (MIP) model, which is solved in two steps with a commercial general-purpose MIP solver.
MaxSAT-based large neighborhood search for high school timetabling
...
...

References

SHOWING 1-10 OF 41 REFERENCES
Local search techniques for large high school timetabling problems
  • Andrea Schaerf
  • Computer Science
    IEEE Trans. Syst. Man Cybern. Part A
  • 1999
TLDR
A solution algorithm (and its implementation) based on local search techniques that alternates different techniques and different types of moves and makes use of an adaptive relaxation of the hard constraints of the high school timetabling problem.
Branch-and-Price: Column Generation for Solving Huge Integer Programs
We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to
A computational study of exact knapsack separation for the generalized assignment problem
TLDR
A cutting plane algorithm working in the space of the variables of the basic formulation of the Generalized Assignment Problem, whose core is an exact separation procedure for the knapsack polytopes induced by the capacity constraints is proposed.
A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
TLDR
An efficient Tabu Search (TS) heuristic with two different memory based diversification strategies for CTTP shows that it produces better solutions than a previously proposed TS found in the literature and faster times are observed in the production of good quality solutions.
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling
TLDR
A case-study where a Branch-and-Cut algorithm yields the “optimal” solution of a real-world timetabling problem of University courses (University Course Timetabling problem) as a Set Packing problem with side constraints.
On the Complexity of Timetable and Multicommodity Flow Problems
A very primitive version of Gotlieb’s timetable problem is shown to be NP-complete, and therefore all the common timetable problems are NP-complete. A polynomial time algorithm, in case all teachers
Metaheuristics for High School Timetabling
TLDR
The results show that GA with local search and tabu search based on temporary problem relaxations both outperform simulated annealing and handmade timetables.
A GRASP-tabu search algorithm for solving school timetabling problems
This paper proposes a hybrid approach to solve school timetabling problems. This approach is a GRASP that uses a partially greedy procedure to construct an initial solution and attempts to improve
...
...