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

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorToffolo, Túlio Ângelo Machado-
Autor(es): dc.creatorWauters, Tony-
Autor(es): dc.creatorMalderen, Sam Van-
Autor(es): dc.creatorBerghe, Greet Vanden-
Data de aceite: dc.date.accessioned2025-08-21T15:15:47Z-
Data de disponibilização: dc.date.available2025-08-21T15:15:47Z-
Data de envio: dc.date.issued2016-10-03-
Data de envio: dc.date.issued2016-10-03-
Data de envio: dc.date.issued2016-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/7013-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.ejor.2015.10.004-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1008378-
Descrição: dc.descriptionThe 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsaberto-
Direitos: dc.rightsO 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.-
Palavras-chave: dc.subjectDecomposition strategies-
Palavras-chave: dc.subjectBranch and bound-
Título: dc.titleBranch-and-bound with decomposition- based lower bounds for the Traveling Umpire Problem.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.