Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem.

Detalhes bibliográficos
Autor(a) principal: Toffolo, Túlio Ângelo Machado
Data de Publicação: 2016
Outros Autores: Wauters, Tony, Malderen, Sam Van, Berghe, Greet Vanden
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_263f33342519ccfd032fcdf2c7e600ff
oai_identifier_str oai:repositorio.ufop.br:123456789/7013
network_acronym_str UFOP
network_name_str Repositório Institucional da UFOP
repository_id_str 3233
spelling Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem.Decomposition strategiesBranch and boundThe 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.2016-10-03T18:04:41Z2016-10-03T18:04:41Z2016info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfTOFFOLO, 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.004O 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/openAccessToffolo, Túlio Ângelo MachadoWauters, TonyMalderen, Sam VanBerghe, Greet Vandenengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOP2019-10-15T18:02:32Zoai:repositorio.ufop.br:123456789/7013Repositó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.none.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.none.fl_str_mv 2016-10-03T18:04:41Z
2016-10-03T18:04:41Z
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.uri.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.
0377-2217
http://www.repositorio.ufop.br/handle/123456789/7013
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.format.none.fl_str_mv application/pdf
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
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_ 1813002811699363840