Variable Neighborhood Search based algorithms for high school timetabling

Autor:	George H. G. Fonseca, Haroldo Gambini Santos
Jazyk:	angličtina
Rok vydání:	2014
Předmět:	General Computer Science Iterated local search Computer science media_common.quotation_subject Management Science and Operations Research Solver Modeling and Simulation Simulated annealing Quality (business) High school Algorithm Variable neighborhood search media_common
Zdroj:	Repositório Institucional da UFOP Universidade Federal de Ouro Preto (UFOP) instacron:UFOP
Popis:	This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC2011), which released many instances from educational institutions around the world and attracted 17 competitors. Some of the VNS algorithm variants were able to outperform the winner of Third I T C solver, which proposed a Simulated Annealing – Iterated local Search approach. This result coupled with another reports in the literature points that VNS based algorithms are a practical solution method for providing high quality solutions for some hard timetabling problems. Moreover they are easy to implement with few parameters to adjust.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6955649856f640f8bbdcd8241972bdce http://www.repositorio.ufop.br/handle/123456789/4240 Zobrazit plný text záznamu