Work

Solving the Traveling Tournament Problem by Packing Three-Vertex Paths

Year: 2014

Type: conference-paper

Abstract: The Traveling Tournament Problem (TTP) is a complex problem in sports scheduling whose solution is a schedule of home and away games meeting specific feasibility requirements, while minimizing the total distance traveled by all the teams. A recently-developed "hybrid" algorithm, combining local search and integer programming, has resulted in best-known solutions for many TTP instances. In this paper, we tackle the TTP from a graph-theoretic perspective, by generating a new "canonical" schedule in which each team's three-game road trips match up with the underlying graph's minimum-weight P_3-packing. By using this new schedule as the initial input for the hybrid algorithm, we develop tournament schedules for five benchmark TTP instances that beat all previously-known solutions.

Source: Proceedings of the AAAI Conference on Artificial Intelligence

DOI: 10.1609/aaai.v28i1.9031

Authors: Marc Goerigk, Richard Hoshino, Ken-ichi Kawarabayashi, Stephan Westphal

Institutions: University of Kaiserslautern, Quest University Canada, National Institute of Informatics, Japan Science and Technology Agency, University of Göttingen

Language: English

Topic: Scheduling and Timetabling Solutions

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: diamond

OpenAlex ID: W292355835

FWCI: 1.052

Cites: 19

Cited by: 16

Related to: 10