On the complexity of the traveling umpire problem

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

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during a double round-robin 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. Even small instances of the TUP are very difficult to solve, and several exact and heuristic approaches for it have been proposed in the literature. To this date, however, no formal proof of the TUP's computational complexity exists. We prove that the decision version of the TUP is NP-complete for certain values of its input parameters.

Original languageEnglish (US)
Pages (from-to)101-111
Number of pages11
JournalTheoretical Computer Science
Volume562
Issue numberC
DOIs
StatePublished - Jan 1 2015

Fingerprint

Computational complexity
Formal Proof
Tournament
Date
Computational Complexity
NP-complete problem
Heuristics
Game
Minimise

Keywords

  • Computational complexity
  • Sports scheduling
  • Traveling umpire problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

On the complexity of the traveling umpire problem. / de Oliveira, Lucas; de Souza, Cid C.; Yunes, Tallys.

In: Theoretical Computer Science, Vol. 562, No. C, 01.01.2015, p. 101-111.

Research output: Contribution to journalArticle

de Oliveira, Lucas ; de Souza, Cid C. ; Yunes, Tallys. / On the complexity of the traveling umpire problem. In: Theoretical Computer Science. 2015 ; Vol. 562, No. C. pp. 101-111.
@article{d1ed10aa0eb3480ea1ead4b5eff61aa0,
title = "On the complexity of the traveling umpire problem",
abstract = "The traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during a double round-robin 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. Even small instances of the TUP are very difficult to solve, and several exact and heuristic approaches for it have been proposed in the literature. To this date, however, no formal proof of the TUP's computational complexity exists. We prove that the decision version of the TUP is NP-complete for certain values of its input parameters.",
keywords = "Computational complexity, Sports scheduling, Traveling umpire problem",
author = "{de Oliveira}, Lucas and {de Souza}, {Cid C.} and Tallys Yunes",
year = "2015",
month = "1",
day = "1",
doi = "10.1016/j.tcs.2014.09.037",
language = "English (US)",
volume = "562",
pages = "101--111",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - On the complexity of the traveling umpire problem

AU - de Oliveira, Lucas

AU - de Souza, Cid C.

AU - Yunes, Tallys

PY - 2015/1/1

Y1 - 2015/1/1

N2 - The traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during a double round-robin 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. Even small instances of the TUP are very difficult to solve, and several exact and heuristic approaches for it have been proposed in the literature. To this date, however, no formal proof of the TUP's computational complexity exists. We prove that the decision version of the TUP is NP-complete for certain values of its input parameters.

AB - The traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during a double round-robin 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. Even small instances of the TUP are very difficult to solve, and several exact and heuristic approaches for it have been proposed in the literature. To this date, however, no formal proof of the TUP's computational complexity exists. We prove that the decision version of the TUP is NP-complete for certain values of its input parameters.

KW - Computational complexity

KW - Sports scheduling

KW - Traveling umpire problem

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

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

U2 - 10.1016/j.tcs.2014.09.037

DO - 10.1016/j.tcs.2014.09.037

M3 - Article

AN - SCOPUS:84923698933

VL - 562

SP - 101

EP - 111

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - C

ER -