Solving the traveling tournament problem by packing three-vertex paths

Goerigk, Marc and Kawarabayashi, Ken Ichi and Hoshino, Richard and Westphal, Stephan (2014) Solving the traveling tournament problem by packing three-vertex paths. In: Proceedings of the National Conference on Artificial Intelligence. AI Access Foundation, CAN, pp. 2271-2277. ISBN 9781577356790

Full text not available from this repository.


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 threegame road trips match up with the underlying graph's minimum-weight P3-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.

Item Type: Contribution in Book/Report/Proceedings
Uncontrolled Keywords: /dk/atira/pure/subjectarea/asjc/1700/1702
Departments: Lancaster University Management School > Management Science
ID Code: 76556
Deposited By: ep_importer_pure
Deposited On: 10 Nov 2015 09:26
Refereed?: Yes
Published?: Published
Last Modified: 15 Jan 2020 06:52

Actions (login required)

View Item View Item