Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/7013
Title: Branch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem.
Authors: Toffolo, Túlio Ângelo Machado
Wauters, Tony
Malderen, Sam Van
Berghe, Greet Vanden
Keywords: Decomposition strategies
Branch and bound
Issue Date: 2016
Citation: 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.
Abstract: 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.
URI: http://www.repositorio.ufop.br/handle/123456789/7013
metadata.dc.identifier.doi: https://doi.org/10.1016/j.ejor.2015.10.004
ISSN: 0377-2217
metadata.dc.rights.license: 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.
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_BranchBoundDecomposition.pdf575,78 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.