Parallel local search algorithms for high school timetabling problems
From MaRDI portal
Recommendations
- A computational study of local search algorithms for Italian high-school timetabling
- Metaheuristics for high school timetabling
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- GOAL solver: a hybrid local search based solver for high school timetabling
Cites work
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 2173815 (Why is no real title available?)
- A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
- A column generation approach to high school timetabling modeled as a multicommodity flow problem
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- A fix-and-optimize heuristic for the high school timetabling problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A survey of metaheuristic-based techniques for university timetabling problems
- A survey of school timetabling research
- A survey of search methodologies and automated system development for examination timetabling
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- An XML format for benchmarks in high school timetabling
- An introduction to timetabling
- GOAL solver: a hybrid local search based solver for high school timetabling
- Integer programming for the generalized high school timetabling problem
- Integrating matheuristics and metaheuristics for timetabling
- Late acceptance hill-climbing for high school timetabling
- Making data structures persistent
- Mathematical models and algorithms for a high school timetabling problem
- Optimization by simulated annealing
- Parallel metaheuristics: recent advances and new trends
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- Strong bounds with cut and column generation for class-teacher timetabling
- The third international timetabling competition
- Variable neighborhood search based algorithms for high school timetabling
Cited in
(5)- A comparative study of modern heuristics on the school timetabling problem
- A computational study of local search algorithms for Italian high-school timetabling
- XHSTT: an XML archive for high school timetabling problems in different countries
- High quality timetables for Italian schools
- scientific article; zbMATH DE number 1786131 (Why is no real title available?)
This page was built for publication: Parallel local search algorithms for high school timetabling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1681327)
