000			01931nam a22001577a 4500
999			_c515453 _d515453
008			210128b ||||| |||| 00| 0 eng d
100			_aBulck, David Van et al _923950
245			_aAn Instance data repository for the round-robin sports timetabling problem
260			_aManagement and Labour Studies
300			_a45(2), May, 2020: p.184-200
520			_aThe sports timetabling problem is a combinatorial optimization problem that consists of creating a timetable that defines against whom, when and where teams play games. This is a complex matter, since real-life sports timetabling applications are typically highly constrained. The vast amount and variety of constraints and the lack of generally accepted benchmark problem instances make that timetable algorithms proposed in the literature are often tested on just one or two specific seasons of the competition under consideration. This is problematic since only a few algorithmic insights are gained. To mitigate this issue, this article provides a problem instance repository containing over 40 different types of instances covering artificial and real-life problem instances. The construction of such a repository is not trivial, since there are dozens of constraints that need to be expressed in a standardized format. For this, our repository relies on RobinX, an XML-supported classification framework. The resulting repository provides a (non-exhaustive) overview of most real-life sports timetabling applications published over the last five decades. For every problem, a short description highlights the most distinguishing characteristics of the problem. The repository is publicly available and will be continuously updated as new instances or better solutions become available. –Reproduced
650			_aTimetabling, Sports scheduling, Benchmark, XML, RobinX _921032
773			_aManagement and Labour Studies
906			_aSPORTS
942			_cAR