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

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

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

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.

Original languageEnglish
Title of host publicationProceedings of the 26th International Conference on Enterprise Information Systems
Subtitle of host publicationVolume 1: ICEIS
EditorsJoaquim Filipe, Michal Smialek, Alexander Brodsky, Slimane Hammoudi
PublisherScience and Technology Publications, Lda
Pages447-455
Number of pages9
Volume1
ISBN (Electronic)9789897586927
DOIs
Publication statusPublished - 2024
Event26th International Conference on Enterprise Information Systems, ICEIS 2024 - Angers, France
Duration: 28 Apr 202430 Apr 2024

Publication series

NameInternational Conference on Enterprise Information Systems, ICEIS - Proceedings
ISSN (Electronic)2184-4992

Conference

Conference26th International Conference on Enterprise Information Systems, ICEIS 2024
Country/TerritoryFrance
CityAngers
Period28/04/2430/04/24

Bibliographical note

Publisher Copyright:
Copyright © 2024 by SCITEPRESS – Science and Technology Publications, Lda.

Keywords

  • Constraint Hierarchy
  • Constraints
  • Evolutionary Computing
  • Genetic Algorithms
  • Traveling Tournament Problem

Fingerprint

Dive into the research topics of 'The Traveling Tournament Problem: Rows-First versus Columns-First'. Together they form a unique fingerprint.

Cite this