Parallel local search algorithms for high school timetabling problems

DOI10.1016/j.ejor.2017.07.029zbMath1374.90169OpenAlexW2735698081MaRDI QIDQ1681327

Alysson M. Costa, Landir Saviniec, Maristela Oliveira Santos

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.07.029

zbMATH Keywords

simulated annealingtabu searchtimetablingiterated local searchparallel metaheuristics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

High quality timetables for Italian schools

Uses Software

• GOAL

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The third international timetabling competition
• GOAL solver: a hybrid local search based solver for high school timetabling
• Late acceptance hill-climbing for high school timetabling
• A two-stage decomposition of high school timetabling applied to cases in Denmark
• A fix-and-optimize heuristic for the high school timetabling problem
• Variable neighborhood search based algorithms for high school timetabling
• Mathematical models and algorithms for a high school timetabling problem
• Integrating matheuristics and metaheuristics for timetabling
• A survey of school timetabling research
• An introduction to timetabling
• A survey of search methodologies and automated system development for examination timetabling
• Integer programming for the generalized high school timetabling problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Making data structures persistent
• A column generation approach to high school timetabling modeled as a multicommodity flow problem
• An XML format for benchmarks in high school timetabling
• Strong bounds with cut and column generation for class-teacher timetabling
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem
• A survey of metaheuristic-based techniques for university timetabling problems
• Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
• A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
• Parallel metaheuristics: recent advances and new trends

This page was built for publication: Parallel local search algorithms for high school timetabling problems