Scheduling double round-robin tournaments with divisional play using constraint programming

Carlsson, Mats; Johansson, Mikael; Larson, Jeffrey

doi:10.1016/j.ejor.2016.11.033

Cited by 13 publications

(9 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The JP-encoding (Section 2.3) model was used in a MiniZinc Challenge and we wanted to show how easy it is now to improve it. The handball tournament (Section 2.4) model was also used in MiniZinc Challenges, and was refined in [7]. That last case study can be seen as a rational reconstruction of a fragment of the refined constraint model.…”

Section: Using the Auto-tabling Annotationmentioning

confidence: 99%

See 1 more Smart Citation

Auto-tabling for subproblem presolving in MiniZinc

et al. 2017

Self Cite

View full text Add to dashboard Cite

A well-known and powerful constraint model reformulation is to compute the solutions to a model part, say a custom constraint predicate, and tabulate them within an extensional constraint that replaces that model part. Despite the possibility of achieving higher solving performance, this tabling reformulation is often not tried, because it is tedious to perform; further, if successful, it obfuscates the original model. In order to encourage modellers to try tabling, we extend the MiniZinc toolchain to perform the automatic tabling of suitably annotated predicate definitions, without requiring any changes to solvers, thereby eliminating both the tedium and the obfuscation. Our experiments show that automated tabling yields the same tables as manual tabling, and that tabling is beneficial for solvers of several solving technologies.

show abstract

Section: Using the Auto-tabling Annotationmentioning

confidence: 99%

“…The presolve time never exceeds 170 ms. We also ran a similar experiment with league size 9 + 9: only Chuffed is able to solve those instances to optimality within 10 minutes. Finally, this case study can be seen as a rational reconstruction of a fragment of the refined constraint model in [7].…”

Section: Let Thementioning

confidence: 99%

Auto-tabling for subproblem presolving in MiniZinc

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…In total 10 instances are based on the 2013–2014 top Swedish handball tournament that organizes a two-phase tournament in which 14 teams are partitioned into two divisions that first play a compact 1RR before playing a mirrored 2RR among all teams (Carlsson et al, 2017; Larson & Johansson, 2014). Two hard constraints make that the phases must be planned in an integrated way: the total number of breaks must be minimal, and teams must meet each other at home and in turn away.…”

Section: Benchmark Instancesmentioning

confidence: 99%

An Instance Data Repository for the Round-robin Sports Timetabling Problem

Bulck

Goossens

̈nberger

et al. 2020

Management and Labour Studies

View full text Add to dashboard Cite

The 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.

show abstract

“…League championship algorithm is capable of finding the most optimum signal strength. It behaves more constantly and is reliable.…”

Section: Proposed Hybrid Wimax/dsrc Systemmentioning

confidence: 99%

A hybrid V2V system for collision‐free high‐speed internet access in intelligent transportation system

Guchhait

Maji

Kandar

2018

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Vehicle‐to‐vehicle communication can be effective in avoiding accident and traffic collision using dedicated short‐range communication (DSRC) in intelligent transportation systems. The problem of DSRC is it works in a short range of 1000 m and its frequency band cannot support a large number of users simultaneously, which leads to multiaccess interference, (MAI) noise, and low transmission rate. Multiaccess interference is referred as the overlapping of signals from different users in the network. A combination of the Worldwide Interoperability for Microwave Access (WiMAX) and the DSRC is proposed to improve the quality of service and network congestion using multiuser detection (MUD) and scheduling technique. This paper proposes a scheduling algorithm called league championship priority scheduling algorithm. In the league championship priority scheduling algorithm, the message will be sent on priority basis, depending on the bandwidth values and network coverage, so that MAI can be avoided. Moreover, MUD plays a major role in identifying the active users and nonactive users based on the condition of the threshold frequency and bandwidth. Thus, the implementation result shows that the proposed algorithm provides high‐transmission data rate and multiaccess interference can be avoided. The performance is evaluated to validate and estimate the performance of MUD and scheduling algorithm.

show abstract

Scheduling double round-robin tournaments with divisional play using constraint programming

Cited by 13 publications

References 28 publications

Auto-tabling for subproblem presolving in MiniZinc

Auto-tabling for subproblem presolving in MiniZinc

An Instance Data Repository for the Round-robin Sports Timetabling Problem

A hybrid V2V system for collision‐free high‐speed internet access in intelligent transportation system

Contact Info

Product

Resources

About