The traveling tournament problem: rows-first versus columns-first
Publication date
2024
Document type
Konferenzbeitrag
Author
Organisational unit
Conference
26th International Conference on Enterprise Information Systems (ICEIS 2024) ; Angers, France ; April 28–30, 2024
Publisher
SciTePress
Book title
Proceedings of the 26th International Conference on Enterprise Information Systems
Volume (part of multivolume book)
1
First page
447
Last page
455
Part of the university bibliography
✅
Language
English
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.
Description
Published under a CC BY-NC-ND 4.0 license (https://creativecommons.org/licenses/by-nc-nd/4.0/)
Version
Published version
Access right on openHSU
Metadata only access