Constructive algorithms for the constant distance traveling tournament problem

  • Authors:

  • Nobutomo Fujiwara;Shinji Imahori;Tomomi Matsui;Ryuhei Miyashiro

  • Affiliations:

  • Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan;Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan;Faculty of Science and Engineering, Chuo University, Tokyo, Japan;Institute of Symbiotic Science and Technology, Tokyo University of Agriculture and Technology, Koganei, Tokyo, Japan

  • Venue:
  • PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The traveling tournament problem considers scheduling round-robin tournaments that minimize traveling distance, which is an important issue in sports scheduling. Various studies on the traveling tournament problem have appeared in recent years, and there are some variants of this problem. In this paper, we deal with the constant distance traveling tournament problem, which is a special class of the traveling tournament problem. This variant is essentially equivalent to the problem of 'maximizing breaks' and that of 'minimizing breaks', which is another significant objective in sports scheduling. We propose a lower bound of the optimal value of the constant distance traveling tournament problem, and two constructive algorithms that produce feasible solutions whose objective values are close to the proposed lower bound. For some size of instances, one of our algorithms yields optimal solutions.