DROPS

Document

DOI: 10.4230/OASIcs.ATMOS.2021.16

An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two

Authors: Diptendu Chatterjee and Bimal Kumar Roy

Published in: OASIcs, Volume 96, 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)

Abstract

The Traveling Tournament Problem(TTP) is a combinatorial optimization problem where we have to give a scheduling algorithm which minimizes the total distance traveled by all the participating teams of a double round-robin tournament maintaining given constraints. Most of the instances of this problem with more than ten teams are still unsolved. By definition of the problem the number of teams participating has to be even. There are different variants of this problem depending on the constraints. In this problem, we consider the case where number of teams is a multiple of four and a team can not play more than two consecutive home or away matches. Our scheduling algorithm gives better result than the existing best result for number of teams less or equal to 32.

Cite as

Diptendu Chatterjee and Bimal Kumar Roy. An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two. In 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021). Open Access Series in Informatics (OASIcs), Volume 96, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{chatterjee_et_al:OASIcs.ATMOS.2021.16,
  author =	{Chatterjee, Diptendu and Roy, Bimal Kumar},
  title =	{{An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two}},
  booktitle =	{21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
  pages =	{16:1--16:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-213-6},
  ISSN =	{2190-6807},
  year =	{2021},
  volume =	{96},
  editor =	{M\"{u}ller-Hannemann, Matthias and Perea, Federico},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.16},
  URN =		{urn:nbn:de:0030-drops-148850},
  doi =		{10.4230/OASIcs.ATMOS.2021.16},
  annote =	{Keywords: Traveling Tournament Problem, Double Round-robin, Scheduling, Approximation}
}

Search Results

Documents authored by Roy, Bimal Kumar

An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two

Abstract

Cite as

Thanks for your feedback!

Could not send message