A SA-VNS approach for the High School Timetabling Problem

DOI10.1016/j.endm.2012.10.023zbMath1268.90134OpenAlexW2014684461MaRDI QIDQ2840769

Túlio A. M. Toffolo, George H. G. Fonseca, Haroldo Gambini Santos, Samuel S. Brito, Marcone Jamilson Freitas Souza

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.repositorio.ufop.br/handle/123456789/4374

zbMATH Keywords

simulated annealinghigh school timetabling problemthird international timetabling competitionvariable neighbourhood search

Mathematics Subject Classification ID

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

Related Items (9)

The third international timetabling competition ⋮ Late acceptance hill-climbing for high school timetabling ⋮ Variable neighborhood search based algorithms for high school timetabling ⋮ maxSAT-based large neighborhood search for high school timetabling ⋮ Integrating matheuristics and metaheuristics for timetabling ⋮ Modeling high school timetabling with bitvectors ⋮ High quality timetables for Italian schools ⋮ Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university ⋮ Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Variable neighbourhood search: Methods and applications
• An XML format for benchmarks in high school timetabling
• Strong bounds with cut and column generation for class-teacher timetabling
• ITC2007 solver description: a hybrid approach
• Adaptive tabu search for course timetabling

This page was built for publication: A SA-VNS approach for the High School Timetabling Problem