The Traveling Tournament Problem: Rows-First versus Columns-First

Kristian Verduin, Kristian Verduin, Ruben Horn, Ruben Horn, Okke van Eck, Okke van Eck, Reitze Jansen, Thomas Weise, Daan van den Berg, Daan van den Berg

2024

Abstract

At the time of writing, there is no known deterministic time algorithm to uniformly sample initial valid solutions for the traveling tournament problem, severely impeding any evolutionary approach that would need a random initial population. Repeatedly random sampling initial solutions until we find a valid one is apparently the best we can do, but even this rather crude method still requires exponential time. It does make a difference however, if one chooses to generate initial schedules column-by-column or row-by-row.

Paper Citation

in Harvard Style

Verduin K., Horn R., van Eck O., Jansen R., Weise T. and van den Berg D. (2024). The Traveling Tournament Problem: Rows-First versus Columns-First. In Proceedings of the 26th International Conference on Enterprise Information Systems - Volume 1: ICEIS; ISBN 978-989-758-692-7, SciTePress, pages 447-455. DOI: 10.5220/0012557700003690

in Bibtex Style

@conference{iceis24,
author={Kristian Verduin and Ruben Horn and Okke van Eck and Reitze Jansen and Thomas Weise and Daan van den Berg},
title={The Traveling Tournament Problem: Rows-First versus Columns-First},
booktitle={Proceedings of the 26th International Conference on Enterprise Information Systems - Volume 1: ICEIS},
year={2024},
pages={447-455},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012557700003690},
isbn={978-989-758-692-7},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 26th International Conference on Enterprise Information Systems - Volume 1: ICEIS
TI - The Traveling Tournament Problem: Rows-First versus Columns-First
SN - 978-989-758-692-7
AU - Verduin K.
AU - Horn R.
AU - van Eck O.
AU - Jansen R.
AU - Weise T.
AU - van den Berg D.
PY - 2024
SP - 447
EP - 455
DO - 10.5220/0012557700003690
PB - SciTePress