Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic

Lucas De Oliveira, Cid C. De Souza, Tallys Yunes

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Given a double round-robin tournament, the traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during the tournament. The objective is to minimize the total distance traveled by the umpires, while respecting constraints that include visiting every team at home, and not seeing a team or venue too often. We strengthen a known integer programming formulation for the TUP and use it to implement a relax-and-fix heuristic that improves the quality of 24 out of 25 best-known feasible solutions to instances in the TUP benchmark. We also improve all best-known lower bounds for those instances and, for the first time, provide lower bounds for instances with more than 16 teams.

Original languageEnglish (US)
Pages (from-to)592-600
Number of pages9
JournalEuropean Journal of Operational Research
Volume236
Issue number2
DOIs
StatePublished - Jul 16 2014

Fingerprint

Integer programming
Heuristics
Tournament
Formulation
Lower bound
Integer Programming
Game
Benchmark
Minimise
Lower bounds

Keywords

  • Baseball
  • Heuristics
  • Integer programming
  • OR in sports
  • Relax-and-fix
  • Traveling umpire problem

ASJC Scopus subject areas

  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

Improved bounds for the traveling umpire problem : A stronger formulation and a relax-and-fix heuristic. / De Oliveira, Lucas; De Souza, Cid C.; Yunes, Tallys.

In: European Journal of Operational Research, Vol. 236, No. 2, 16.07.2014, p. 592-600.

Research output: Contribution to journalArticle

@article{5a97f707f9d4467c87bcdd6c0d87a657,
title = "Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic",
abstract = "Given a double round-robin tournament, the traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during the tournament. The objective is to minimize the total distance traveled by the umpires, while respecting constraints that include visiting every team at home, and not seeing a team or venue too often. We strengthen a known integer programming formulation for the TUP and use it to implement a relax-and-fix heuristic that improves the quality of 24 out of 25 best-known feasible solutions to instances in the TUP benchmark. We also improve all best-known lower bounds for those instances and, for the first time, provide lower bounds for instances with more than 16 teams.",
keywords = "Baseball, Heuristics, Integer programming, OR in sports, Relax-and-fix, Traveling umpire problem",
author = "{De Oliveira}, Lucas and {De Souza}, {Cid C.} and Tallys Yunes",
year = "2014",
month = "7",
day = "16",
doi = "10.1016/j.ejor.2013.12.019",
language = "English (US)",
volume = "236",
pages = "592--600",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Improved bounds for the traveling umpire problem

T2 - A stronger formulation and a relax-and-fix heuristic

AU - De Oliveira, Lucas

AU - De Souza, Cid C.

AU - Yunes, Tallys

PY - 2014/7/16

Y1 - 2014/7/16

N2 - Given a double round-robin tournament, the traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during the tournament. The objective is to minimize the total distance traveled by the umpires, while respecting constraints that include visiting every team at home, and not seeing a team or venue too often. We strengthen a known integer programming formulation for the TUP and use it to implement a relax-and-fix heuristic that improves the quality of 24 out of 25 best-known feasible solutions to instances in the TUP benchmark. We also improve all best-known lower bounds for those instances and, for the first time, provide lower bounds for instances with more than 16 teams.

AB - Given a double round-robin tournament, the traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during the tournament. The objective is to minimize the total distance traveled by the umpires, while respecting constraints that include visiting every team at home, and not seeing a team or venue too often. We strengthen a known integer programming formulation for the TUP and use it to implement a relax-and-fix heuristic that improves the quality of 24 out of 25 best-known feasible solutions to instances in the TUP benchmark. We also improve all best-known lower bounds for those instances and, for the first time, provide lower bounds for instances with more than 16 teams.

KW - Baseball

KW - Heuristics

KW - Integer programming

KW - OR in sports

KW - Relax-and-fix

KW - Traveling umpire problem

UR - http://www.scopus.com/inward/record.url?scp=84896495623&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896495623&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2013.12.019

DO - 10.1016/j.ejor.2013.12.019

M3 - Article

AN - SCOPUS:84896495623

VL - 236

SP - 592

EP - 600

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -