Integrating matheuristics and metaheuristics for timetabling.
Autor(a) principal: | |
---|---|
Data de Publicação: | 2016 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFOP |
Texto Completo: | http://www.repositorio.ufop.br/handle/123456789/6974 https://doi.org/10.1016/j.cor.2016.04.016 |
Resumo: | The High School Timetabling Problem requires the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The most common approach for this problem is to employ metaheuristic methods. This work presents a matheuristic approach that combines a Variable Neighbourhood Search algorithm with mathematical programming-based neighbourhoods for high school timetabling. Computational experiments on well-known benchmark instances demonstrate the success of the proposed hybrid approach, which outperforms the standalone Variable Neighbour- hood Search algorithm by far. Additionally, the proposed algorithm was able to improve 15 out of 17 current best known solutions in a very famous benchmark set. |
id |
UFOP_5f7b63587d166a0463ba33ca286f16de |
---|---|
oai_identifier_str |
oai:localhost:123456789/6974 |
network_acronym_str |
UFOP |
network_name_str |
Repositório Institucional da UFOP |
repository_id_str |
3233 |
spelling |
Fonseca, George Henrique Godim daSantos, Haroldo GambiniCarrano, Eduardo Gontijo2016-09-05T20:06:48Z2016-09-05T20:06:48Z2016FONSECA, G. H. G. da; SANTOS, H. G.; CARRANO, E. G. Integrating matheuristics and metaheuristics for timetabling. Computers & Operations Research, v. 1, p. 1-28, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0305054816300879>. Acesso em: 07 ago. 2016.0305-0548http://www.repositorio.ufop.br/handle/123456789/6974https://doi.org/10.1016/j.cor.2016.04.016The High School Timetabling Problem requires the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The most common approach for this problem is to employ metaheuristic methods. This work presents a matheuristic approach that combines a Variable Neighbourhood Search algorithm with mathematical programming-based neighbourhoods for high school timetabling. Computational experiments on well-known benchmark instances demonstrate the success of the proposed hybrid approach, which outperforms the standalone Variable Neighbour- hood Search algorithm by far. Additionally, the proposed algorithm was able to improve 15 out of 17 current best known solutions in a very famous benchmark set.O periódico Computers & Operations Research concede permissão para depósito deste artigo no Repositório Institucional da UFOP. Número da licença: 3926560954953.info:eu-repo/semantics/openAccessMatheuristicsMetaheuristicsTimetablingIntegrating matheuristics and metaheuristics for timetabling.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPLICENSElicense.txtlicense.txttext/plain; charset=utf-8924http://www.repositorio.ufop.br/bitstream/123456789/6974/2/license.txt62604f8d955274beb56c80ce1ee5dcaeMD52ORIGINALARTIGO_IntegratingMatheuristicsMetaheuristics.pdfARTIGO_IntegratingMatheuristicsMetaheuristics.pdfapplication/pdf1858820http://www.repositorio.ufop.br/bitstream/123456789/6974/1/ARTIGO_IntegratingMatheuristicsMetaheuristics.pdf3dc55bb65efb011bfc86500d641a0c22MD51123456789/69742019-10-14 10:23:22.786oai:localhost:123456789/6974RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332019-10-14T14:23:22Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false |
dc.title.pt_BR.fl_str_mv |
Integrating matheuristics and metaheuristics for timetabling. |
title |
Integrating matheuristics and metaheuristics for timetabling. |
spellingShingle |
Integrating matheuristics and metaheuristics for timetabling. Fonseca, George Henrique Godim da Matheuristics Metaheuristics Timetabling |
title_short |
Integrating matheuristics and metaheuristics for timetabling. |
title_full |
Integrating matheuristics and metaheuristics for timetabling. |
title_fullStr |
Integrating matheuristics and metaheuristics for timetabling. |
title_full_unstemmed |
Integrating matheuristics and metaheuristics for timetabling. |
title_sort |
Integrating matheuristics and metaheuristics for timetabling. |
author |
Fonseca, George Henrique Godim da |
author_facet |
Fonseca, George Henrique Godim da Santos, Haroldo Gambini Carrano, Eduardo Gontijo |
author_role |
author |
author2 |
Santos, Haroldo Gambini Carrano, Eduardo Gontijo |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Fonseca, George Henrique Godim da Santos, Haroldo Gambini Carrano, Eduardo Gontijo |
dc.subject.por.fl_str_mv |
Matheuristics Metaheuristics Timetabling |
topic |
Matheuristics Metaheuristics Timetabling |
description |
The High School Timetabling Problem requires the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The most common approach for this problem is to employ metaheuristic methods. This work presents a matheuristic approach that combines a Variable Neighbourhood Search algorithm with mathematical programming-based neighbourhoods for high school timetabling. Computational experiments on well-known benchmark instances demonstrate the success of the proposed hybrid approach, which outperforms the standalone Variable Neighbour- hood Search algorithm by far. Additionally, the proposed algorithm was able to improve 15 out of 17 current best known solutions in a very famous benchmark set. |
publishDate |
2016 |
dc.date.accessioned.fl_str_mv |
2016-09-05T20:06:48Z |
dc.date.available.fl_str_mv |
2016-09-05T20:06:48Z |
dc.date.issued.fl_str_mv |
2016 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
FONSECA, G. H. G. da; SANTOS, H. G.; CARRANO, E. G. Integrating matheuristics and metaheuristics for timetabling. Computers & Operations Research, v. 1, p. 1-28, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0305054816300879>. Acesso em: 07 ago. 2016. |
dc.identifier.uri.fl_str_mv |
http://www.repositorio.ufop.br/handle/123456789/6974 |
dc.identifier.issn.none.fl_str_mv |
0305-0548 |
dc.identifier.doi.none.fl_str_mv |
https://doi.org/10.1016/j.cor.2016.04.016 |
identifier_str_mv |
FONSECA, G. H. G. da; SANTOS, H. G.; CARRANO, E. G. Integrating matheuristics and metaheuristics for timetabling. Computers & Operations Research, v. 1, p. 1-28, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0305054816300879>. Acesso em: 07 ago. 2016. 0305-0548 |
url |
http://www.repositorio.ufop.br/handle/123456789/6974 https://doi.org/10.1016/j.cor.2016.04.016 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFOP instname:Universidade Federal de Ouro Preto (UFOP) instacron:UFOP |
instname_str |
Universidade Federal de Ouro Preto (UFOP) |
instacron_str |
UFOP |
institution |
UFOP |
reponame_str |
Repositório Institucional da UFOP |
collection |
Repositório Institucional da UFOP |
bitstream.url.fl_str_mv |
http://www.repositorio.ufop.br/bitstream/123456789/6974/2/license.txt http://www.repositorio.ufop.br/bitstream/123456789/6974/1/ARTIGO_IntegratingMatheuristicsMetaheuristics.pdf |
bitstream.checksum.fl_str_mv |
62604f8d955274beb56c80ce1ee5dcae 3dc55bb65efb011bfc86500d641a0c22 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP) |
repository.mail.fl_str_mv |
repositorio@ufop.edu.br |
_version_ |
1801685783501864960 |