Elsevier

Discrete Applied Mathematics

Volume 211, 1 October 2016, Pages 113-120
Discrete Applied Mathematics

Sports scheduling search space connectivity: A riffle shuffle driven approach

https://doi.org/10.1016/j.dam.2016.04.018Get rights and content
Under an Elsevier user license
open archive

Abstract

The canonical method is widely used to build single round robin schedules for sports competitions. Certain properties of the canonical method may entrap local search procedures. In this paper, we study the connectivity of one of the most used neighborhood structures in local search heuristics for single round robin scheduling and characterize the conditions in which this entrapment happens. This characterization brings to light a relation between the connectivity of the analyzed neighborhood and the riffle shuffle, a method of shuffling playing cards.

Keywords

Riffle shuffle
Sport scheduling
Graph theory
Canonical method

Cited by (0)

1

Tel.: +55 31 3409 5860.

2

Tel.: +41 21 69 32562.