The Traveling Social Golfer Problem: The Case of the Volleyball Nations League

Roel Lambers; Laurent Rothuizen; Frits C.R. Spieksma

doi:10.1007/978-3-030-78230-6_10

The Traveling Social Golfer Problem: The Case of the Volleyball Nations League

Roel Lambers, Laurent Rothuizen, Frits C.R. Spieksma

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

3 Citations (Scopus)

Abstract

The Volleyball Nations League is the elite annual international competition within volleyball, with the sixteen best nations per gender contesting the trophy in a tournament that spans over 6 weeks. The first five weeks contain a single round robin tournament, where matches are played in different venues across the globe. As a result of this setup, there is a large discrepancy between the travel burdens of meeting teams, which is a disadvantage for the teams that have to travel a lot. We analyse this problem, and find that it is related to the well-known Social Golfer Problem. We propose a decomposition approach for the resulting optimization problem, leading to the so-called Venue Assignment Problem. Using integer programming methods, we find, for real-life instances, the fairest schedules with respect to the difference in travel distance.

Original language	English
Title of host publication	Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings
Editors	Peter J. Stuckey
Publisher	Springer
Pages	149-162
Number of pages	14
ISBN (Print)	9783030782290
DOIs	https://doi.org/10.1007/978-3-030-78230-6_10
Publication status	Published - 2021
Event	18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2021 - Virtual, Online Duration: 5 Jul 2021 → 8 Jul 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12735 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2021
City	Virtual, Online
Period	5/07/21 → 8/07/21

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

Keywords

Integer programming
Social Golfer problem
Volleyball Nations League

Access to Document

10.1007/978-3-030-78230-6_10

Cite this

Lambers, R., Rothuizen, L., & Spieksma, F. C. R. (2021). The Traveling Social Golfer Problem: The Case of the Volleyball Nations League. In P. J. Stuckey (Ed.), Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings (pp. 149-162). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12735 LNCS). Springer. https://doi.org/10.1007/978-3-030-78230-6_10

Lambers, Roel ; Rothuizen, Laurent ; Spieksma, Frits C.R. / The Traveling Social Golfer Problem : The Case of the Volleyball Nations League. Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings. editor / Peter J. Stuckey. Springer, 2021. pp. 149-162 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{df3ad76bab9d437cb5a8ccc4755a0a1c,

title = "The Traveling Social Golfer Problem: The Case of the Volleyball Nations League",

abstract = "The Volleyball Nations League is the elite annual international competition within volleyball, with the sixteen best nations per gender contesting the trophy in a tournament that spans over 6 weeks. The first five weeks contain a single round robin tournament, where matches are played in different venues across the globe. As a result of this setup, there is a large discrepancy between the travel burdens of meeting teams, which is a disadvantage for the teams that have to travel a lot. We analyse this problem, and find that it is related to the well-known Social Golfer Problem. We propose a decomposition approach for the resulting optimization problem, leading to the so-called Venue Assignment Problem. Using integer programming methods, we find, for real-life instances, the fairest schedules with respect to the difference in travel distance.",

keywords = "Integer programming, Social Golfer problem, Volleyball Nations League",

author = "Roel Lambers and Laurent Rothuizen and Spieksma, {Frits C.R.}",

note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2021 ; Conference date: 05-07-2021 Through 08-07-2021",

year = "2021",

doi = "10.1007/978-3-030-78230-6_10",

language = "English",

isbn = "9783030782290",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "149--162",

editor = "Stuckey, {Peter J.}",

booktitle = "Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings",

address = "Germany",

}

Lambers, R, Rothuizen, L & Spieksma, FCR 2021, The Traveling Social Golfer Problem: The Case of the Volleyball Nations League. in PJ Stuckey (ed.), Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12735 LNCS, Springer, pp. 149-162, 18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2021, Virtual, Online, 5/07/21. https://doi.org/10.1007/978-3-030-78230-6_10

The Traveling Social Golfer Problem: The Case of the Volleyball Nations League. / Lambers, Roel; Rothuizen, Laurent; Spieksma, Frits C.R.
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings. ed. / Peter J. Stuckey. Springer, 2021. p. 149-162 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12735 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - The Traveling Social Golfer Problem

T2 - 18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2021

AU - Lambers, Roel

AU - Rothuizen, Laurent

AU - Spieksma, Frits C.R.

PY - 2021

Y1 - 2021

N2 - The Volleyball Nations League is the elite annual international competition within volleyball, with the sixteen best nations per gender contesting the trophy in a tournament that spans over 6 weeks. The first five weeks contain a single round robin tournament, where matches are played in different venues across the globe. As a result of this setup, there is a large discrepancy between the travel burdens of meeting teams, which is a disadvantage for the teams that have to travel a lot. We analyse this problem, and find that it is related to the well-known Social Golfer Problem. We propose a decomposition approach for the resulting optimization problem, leading to the so-called Venue Assignment Problem. Using integer programming methods, we find, for real-life instances, the fairest schedules with respect to the difference in travel distance.

AB - The Volleyball Nations League is the elite annual international competition within volleyball, with the sixteen best nations per gender contesting the trophy in a tournament that spans over 6 weeks. The first five weeks contain a single round robin tournament, where matches are played in different venues across the globe. As a result of this setup, there is a large discrepancy between the travel burdens of meeting teams, which is a disadvantage for the teams that have to travel a lot. We analyse this problem, and find that it is related to the well-known Social Golfer Problem. We propose a decomposition approach for the resulting optimization problem, leading to the so-called Venue Assignment Problem. Using integer programming methods, we find, for real-life instances, the fairest schedules with respect to the difference in travel distance.

KW - Integer programming

KW - Social Golfer problem

KW - Volleyball Nations League

UR - http://www.scopus.com/inward/record.url?scp=85111236365&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-78230-6_10

DO - 10.1007/978-3-030-78230-6_10

M3 - Conference contribution

AN - SCOPUS:85111236365

SN - 9783030782290

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 149

EP - 162

BT - Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings

A2 - Stuckey, Peter J.

PB - Springer

Y2 - 5 July 2021 through 8 July 2021

ER -

Lambers R, Rothuizen L, Spieksma FCR. The Traveling Social Golfer Problem: The Case of the Volleyball Nations League. In Stuckey PJ, editor, Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings. Springer. 2021. p. 149-162. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-78230-6_10

The Traveling Social Golfer Problem: The Case of the Volleyball Nations League

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this