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 language | English |
---|---|
Title of host publication | Proceedings of the 26th International Conference on Enterprise Information Systems |
Subtitle of host publication | Volume 1: ICEIS |
Editors | Joaquim Filipe, Michal Smialek, Alexander Brodsky, Slimane Hammoudi |
Publisher | Science and Technology Publications, Lda |
Pages | 447-455 |
Number of pages | 9 |
Volume | 1 |
ISBN (Electronic) | 9789897586927 |
DOIs | |
Publication status | Published - 2024 |
Event | 26th International Conference on Enterprise Information Systems, ICEIS 2024 - Angers, France Duration: 28 Apr 2024 → 30 Apr 2024 |
Publication series
Name | International Conference on Enterprise Information Systems, ICEIS - Proceedings |
---|---|
ISSN (Electronic) | 2184-4992 |
Conference
Conference | 26th International Conference on Enterprise Information Systems, ICEIS 2024 |
---|---|
Country/Territory | France |
City | Angers |
Period | 28/04/24 → 30/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