Citation
Improving Upper Bounds in High School Timetabling by Matheuristics. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 267-275, 2015.
Paper
Abstract
The High School Timetabling Problem requires assignment of timeslots and resources to events, respecting given constraints. The most common approaches for this type of timetabling problems are meta-heuristics. This work presents a matheuristic approach combining a Variable Neighbourhood Search algorithm with mathematical programming-based neighbourhoods for high school timetabling. The computational experiments on well-known benchmark instances demonstrate the success of the proposed matheuristic approach, improving the 14 out of 17 best known solutions from the XHSTT-2014 archive.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2015-267-275-P, author = {G.H.G. Fonseca and H.G. Santos and E.G. Carrano},
title = {Improving Upper Bounds in High School Timetabling by Matheuristics},
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {267--275},
note = {Paper},
abstract = {The High School Timetabling Problem requires assignment of timeslots and resources to events, respecting given constraints. The most common approaches for this type of timetabling problems are meta-heuristics. This work presents a matheuristic approach combining a Variable Neighbourhood Search algorithm with mathematical programming-based neighbourhoods for high school timetabling. The computational experiments on well-known benchmark instances demonstrate the success of the proposed matheuristic approach, improving the 14 out of 17 best known solutions from the XHSTT-2014 archive. },
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-267-275-P.pdf} }