Use este identificador para citar ou linkar para este item: http://www.repositorio.ufop.br/jspui/handle/123456789/12527
Registro completo de metadados
Campo Dublin CoreValorIdioma
dc.contributor.authorToffolo, Túlio Ângelo Machado-
dc.contributor.authorWauters, Tony-
dc.date.accessioned2020-07-29T14:41:07Z-
dc.date.available2020-07-29T14:41:07Z-
dc.date.issued2019-
dc.identifier.citationTOFFOLO, T. A. M.; WAUTERS, T. Analysis of a constructive matheuristic for the traveling umpire problem. Journal of Quantitative Analysis in Sports, v. 15, n.1. p. 41-57, fev. 2019. Disponível em: <https://www.degruyter.com/view/journals/jqas/15/1/article-p41.xml>. Acesso em: 18 jun. 2020.pt_BR
dc.identifier.issn1559-0410-
dc.identifier.urihttp://www.repositorio.ufop.br/handle/123456789/12527-
dc.description.abstractThe Traveling Umpire Problem (TUP) is a combinatorial optimization problem concerning the assignment of umpires to the games of a fixed double roundrobin tournament. The TUP draws inspiration from the real world multi-objective Major League Baseball (MLB) umpire scheduling problem, but is, however, restricted to the single objective of minimizing total travel distance of the umpires. Several hard constraints are employed to enforce fairness when assigning umpires, making it a challenging optimization problem. The present work concerns a constructive matheuristic approach which focuses primarily on large benchmark instances. A decompositionbased approach is employed which sequentially solves Integer Programming (IP) formulations of the subproblems to arrive at a feasible solution for the entire problem. This constructive matheuristic efficiently generates feasible solutions and improves the best known solutions of large benchmark instances of 26, 28, 30 and 32 teams well within the benchmark time limit. In addition, the algorithm is capable of producing feasible solutions for various small and medium benchmark instances competitive with those produced by other heuristic algorithms. The paper also details experiments conducted to evaluate various algorithmic design parameters such as subproblem size, overlap and objective functions.pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectDecompositionpt_BR
dc.subjectInteger programmingpt_BR
dc.subjectSports schedulingpt_BR
dc.titleAnalysis of a constructive matheuristic for the traveling umpire problem.pt_BR
dc.typeArtigo publicado em periodicopt_BR
dc.identifier.uri2https://www.degruyter.com/view/journals/jqas/15/1/article-p41.xmlpt_BR
dc.identifier.doihttps://doi.org/10.1515/jqas-2017-0118pt_BR
Aparece nas coleções:DECOM - Artigos publicados em periódicos

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
ARTIGO_AnalysisConstructiveMatheuristic.pdf
  Restricted Access
867,88 kBAdobe PDFVisualizar/Abrir


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.