Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem.
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/7013 https://doi.org/10.1016/j.ejor.2015.10.004 |
Resumo: | The Traveling Umpire Problem (TUP) is an optimization problem in which umpires have to be assigned to games in a double round robin tournament. The objective is to obtain a solution with minimum total travel distance over all umpires, while respecting hard constraints on assignments and sequences. Up till now, no general nor dedicated algorithm was able to solve all instances with 12 and 14 teams. We present a novel branch-and-bound approach to the TUP, in which a decomposition scheme coupled with an efficient propagation technique produces the lower bounds. The algorithm is able to generate optimal solutions for all the 12- and 14-team instances as well as for 11 of the 16-team instances. In addition to the new optimal solutions, some new best solutions are presented and other instances have been proven infeasible. |
id |
UFOP_1819f4a9cf77f485a236f310b6ac4790 |
---|---|
oai_identifier_str |
oai:localhost:123456789/7013 |
network_acronym_str |
UFOP |
network_name_str |
Repositório Institucional da UFOP |
repository_id_str |
3233 |
spelling |
Toffolo, Túlio Ângelo MachadoWauters, TonyMalderen, Sam VanBerghe, Greet Vanden2016-10-03T18:04:41Z2016-10-03T18:04:41Z2016TOFFOLO, T. A. M. et al. Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem. European Journal of Operational Research, v. 250, p. 737-744, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S037722171500911X>. Acesso em: 07 ago. 2016.0377-2217http://www.repositorio.ufop.br/handle/123456789/7013https://doi.org/10.1016/j.ejor.2015.10.004The Traveling Umpire Problem (TUP) is an optimization problem in which umpires have to be assigned to games in a double round robin tournament. The objective is to obtain a solution with minimum total travel distance over all umpires, while respecting hard constraints on assignments and sequences. Up till now, no general nor dedicated algorithm was able to solve all instances with 12 and 14 teams. We present a novel branch-and-bound approach to the TUP, in which a decomposition scheme coupled with an efficient propagation technique produces the lower bounds. The algorithm is able to generate optimal solutions for all the 12- and 14-team instances as well as for 11 of the 16-team instances. In addition to the new optimal solutions, some new best solutions are presented and other instances have been proven infeasible.O periódico European Journal of Operational Research concede permissão para depósito deste artigo no Repositório Institucional da UFOP. Número da licença: 3934300574318.info:eu-repo/semantics/openAccessDecomposition strategiesBranch and boundBranch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem.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/7013/2/license.txt62604f8d955274beb56c80ce1ee5dcaeMD52ORIGINALARTIGO_BranchBoundDecomposition.pdfARTIGO_BranchBoundDecomposition.pdfapplication/pdf589595http://www.repositorio.ufop.br/bitstream/123456789/7013/1/ARTIGO_BranchBoundDecomposition.pdfe548f7c25bbc47ea638a6b8e0d493bc0MD51123456789/70132019-10-15 14:02:32.648oai:localhost:123456789/7013RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332019-10-15T18:02:32Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false |
dc.title.pt_BR.fl_str_mv |
Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem. |
title |
Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem. |
spellingShingle |
Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem. Toffolo, Túlio Ângelo Machado Decomposition strategies Branch and bound |
title_short |
Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem. |
title_full |
Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem. |
title_fullStr |
Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem. |
title_full_unstemmed |
Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem. |
title_sort |
Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem. |
author |
Toffolo, Túlio Ângelo Machado |
author_facet |
Toffolo, Túlio Ângelo Machado Wauters, Tony Malderen, Sam Van Berghe, Greet Vanden |
author_role |
author |
author2 |
Wauters, Tony Malderen, Sam Van Berghe, Greet Vanden |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Toffolo, Túlio Ângelo Machado Wauters, Tony Malderen, Sam Van Berghe, Greet Vanden |
dc.subject.por.fl_str_mv |
Decomposition strategies Branch and bound |
topic |
Decomposition strategies Branch and bound |
description |
The Traveling Umpire Problem (TUP) is an optimization problem in which umpires have to be assigned to games in a double round robin tournament. The objective is to obtain a solution with minimum total travel distance over all umpires, while respecting hard constraints on assignments and sequences. Up till now, no general nor dedicated algorithm was able to solve all instances with 12 and 14 teams. We present a novel branch-and-bound approach to the TUP, in which a decomposition scheme coupled with an efficient propagation technique produces the lower bounds. The algorithm is able to generate optimal solutions for all the 12- and 14-team instances as well as for 11 of the 16-team instances. In addition to the new optimal solutions, some new best solutions are presented and other instances have been proven infeasible. |
publishDate |
2016 |
dc.date.accessioned.fl_str_mv |
2016-10-03T18:04:41Z |
dc.date.available.fl_str_mv |
2016-10-03T18:04:41Z |
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 |
TOFFOLO, T. A. M. et al. Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem. European Journal of Operational Research, v. 250, p. 737-744, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S037722171500911X>. Acesso em: 07 ago. 2016. |
dc.identifier.uri.fl_str_mv |
http://www.repositorio.ufop.br/handle/123456789/7013 |
dc.identifier.issn.none.fl_str_mv |
0377-2217 |
dc.identifier.doi.none.fl_str_mv |
https://doi.org/10.1016/j.ejor.2015.10.004 |
identifier_str_mv |
TOFFOLO, T. A. M. et al. Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem. European Journal of Operational Research, v. 250, p. 737-744, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S037722171500911X>. Acesso em: 07 ago. 2016. 0377-2217 |
url |
http://www.repositorio.ufop.br/handle/123456789/7013 https://doi.org/10.1016/j.ejor.2015.10.004 |
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/7013/2/license.txt http://www.repositorio.ufop.br/bitstream/123456789/7013/1/ARTIGO_BranchBoundDecomposition.pdf |
bitstream.checksum.fl_str_mv |
62604f8d955274beb56c80ce1ee5dcae e548f7c25bbc47ea638a6b8e0d493bc0 |
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_ |
1801685723316748288 |