An application of the traveling tournament problem: the Argentine volleyball league

Autores
Bonomo, Flavia; Cardemil, Andres; Duran, Guillermo Alfredo; Marenco, Javier Leonardo; Sabán, Daniela Hilén
Año de publicación
2012
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
This article describes the optimization process used to schedule the First Division of Argentina’s professional volleyball league. The teams in the league are grouped into couples and matches are held on Thursdays and Saturdays. In every pair of consecutive Thursday-Saturday matches, the two teams in each couple play against two teams from another couple. Minimization of travel distances is critical since the teams’ home locations are scattered throughout the country and teams do not return their home sites between consecutive away matches, making this problem a variation of the well-known traveling tournament problem. The coupled format gives rise to two key decisions: (a) how to couple the teams and (b) how to schedule the matches. We apply integer programming techniques and a tabu search heuristic to solve these issues. The resulting schedules have been successfully used in the 2007-2008, 2008-2009, 2009-2010, and 2010-2011 league seasons, reducing the total travel distance while meeting all of the teams’ requirements. This is the first reported application of the traveling tournament problem to a real-world sports league in the optimization literature.
Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Cardemil, Andres. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Marenco, Javier Leonardo. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina
Fil: Sabán, Daniela Hilén. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Materia
Sports Scheduling
Integer Programming
Traveling Tournament Problem
Team Couples
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/21018
Acceder
id CONICETDig_52c483202d260135ffb85bd10e028f16
oai_identifier_str oai:ri.conicet.gov.ar:11336/21018
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling An application of the traveling tournament problem: the Argentine volleyball leagueBonomo, FlaviaCardemil, AndresDuran, Guillermo AlfredoMarenco, Javier LeonardoSabán, Daniela HilénSports SchedulingInteger ProgrammingTraveling Tournament ProblemTeam Coupleshttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1This article describes the optimization process used to schedule the First Division of Argentina’s professional volleyball league. The teams in the league are grouped into couples and matches are held on Thursdays and Saturdays. In every pair of consecutive Thursday-Saturday matches, the two teams in each couple play against two teams from another couple. Minimization of travel distances is critical since the teams’ home locations are scattered throughout the country and teams do not return their home sites between consecutive away matches, making this problem a variation of the well-known traveling tournament problem. The coupled format gives rise to two key decisions: (a) how to couple the teams and (b) how to schedule the matches. We apply integer programming techniques and a tabu search heuristic to solve these issues. The resulting schedules have been successfully used in the 2007-2008, 2008-2009, 2009-2010, and 2010-2011 league seasons, reducing the total travel distance while meeting all of the teams’ requirements. This is the first reported application of the traveling tournament problem to a real-world sports league in the optimization literature.Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Cardemil, Andres. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Marenco, Javier Leonardo. Universidad Nacional de General Sarmiento. Instituto de Ciencias; ArgentinaFil: Sabán, Daniela Hilén. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaInforms2012-05info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/21018Bonomo, Flavia; Cardemil, Andres; Duran, Guillermo Alfredo; Marenco, Javier Leonardo; Sabán, Daniela Hilén; An application of the traveling tournament problem: the Argentine volleyball league; Informs; Interfaces; 42; 3; 5-2012; 245-2590092-2102CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1287/inte.1110.0587info:eu-repo/semantics/altIdentifier/url/http://pubsonline.informs.org/doi/abs/10.1287/inte.1110.0587info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T10:06:39Zoai:ri.conicet.gov.ar:11336/21018instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 10:06:39.755CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv An application of the traveling tournament problem: the Argentine volleyball league
title An application of the traveling tournament problem: the Argentine volleyball league
spellingShingle An application of the traveling tournament problem: the Argentine volleyball league
Bonomo, Flavia
Sports Scheduling
Integer Programming
Traveling Tournament Problem
Team Couples
title_short An application of the traveling tournament problem: the Argentine volleyball league
title_full An application of the traveling tournament problem: the Argentine volleyball league
title_fullStr An application of the traveling tournament problem: the Argentine volleyball league
title_full_unstemmed An application of the traveling tournament problem: the Argentine volleyball league
title_sort An application of the traveling tournament problem: the Argentine volleyball league
dc.creator.none.fl_str_mv Bonomo, Flavia
Cardemil, Andres
Duran, Guillermo Alfredo
Marenco, Javier Leonardo
Sabán, Daniela Hilén
author Bonomo, Flavia
author_facet Bonomo, Flavia
Cardemil, Andres
Duran, Guillermo Alfredo
Marenco, Javier Leonardo
Sabán, Daniela Hilén
author_role author
author2 Cardemil, Andres
Duran, Guillermo Alfredo
Marenco, Javier Leonardo
Sabán, Daniela Hilén
author2_role author
author
author
author
dc.subject.none.fl_str_mv Sports Scheduling
Integer Programming
Traveling Tournament Problem
Team Couples
topic Sports Scheduling
Integer Programming
Traveling Tournament Problem
Team Couples
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv This article describes the optimization process used to schedule the First Division of Argentina’s professional volleyball league. The teams in the league are grouped into couples and matches are held on Thursdays and Saturdays. In every pair of consecutive Thursday-Saturday matches, the two teams in each couple play against two teams from another couple. Minimization of travel distances is critical since the teams’ home locations are scattered throughout the country and teams do not return their home sites between consecutive away matches, making this problem a variation of the well-known traveling tournament problem. The coupled format gives rise to two key decisions: (a) how to couple the teams and (b) how to schedule the matches. We apply integer programming techniques and a tabu search heuristic to solve these issues. The resulting schedules have been successfully used in the 2007-2008, 2008-2009, 2009-2010, and 2010-2011 league seasons, reducing the total travel distance while meeting all of the teams’ requirements. This is the first reported application of the traveling tournament problem to a real-world sports league in the optimization literature.
Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Cardemil, Andres. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Marenco, Javier Leonardo. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina
Fil: Sabán, Daniela Hilén. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
description This article describes the optimization process used to schedule the First Division of Argentina’s professional volleyball league. The teams in the league are grouped into couples and matches are held on Thursdays and Saturdays. In every pair of consecutive Thursday-Saturday matches, the two teams in each couple play against two teams from another couple. Minimization of travel distances is critical since the teams’ home locations are scattered throughout the country and teams do not return their home sites between consecutive away matches, making this problem a variation of the well-known traveling tournament problem. The coupled format gives rise to two key decisions: (a) how to couple the teams and (b) how to schedule the matches. We apply integer programming techniques and a tabu search heuristic to solve these issues. The resulting schedules have been successfully used in the 2007-2008, 2008-2009, 2009-2010, and 2010-2011 league seasons, reducing the total travel distance while meeting all of the teams’ requirements. This is the first reported application of the traveling tournament problem to a real-world sports league in the optimization literature.
publishDate 2012
dc.date.none.fl_str_mv 2012-05
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/21018
Bonomo, Flavia; Cardemil, Andres; Duran, Guillermo Alfredo; Marenco, Javier Leonardo; Sabán, Daniela Hilén; An application of the traveling tournament problem: the Argentine volleyball league; Informs; Interfaces; 42; 3; 5-2012; 245-259
0092-2102
CONICET Digital
CONICET
url http://hdl.handle.net/11336/21018
identifier_str_mv Bonomo, Flavia; Cardemil, Andres; Duran, Guillermo Alfredo; Marenco, Javier Leonardo; Sabán, Daniela Hilén; An application of the traveling tournament problem: the Argentine volleyball league; Informs; Interfaces; 42; 3; 5-2012; 245-259
0092-2102
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1287/inte.1110.0587
info:eu-repo/semantics/altIdentifier/url/http://pubsonline.informs.org/doi/abs/10.1287/inte.1110.0587
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Informs
publisher.none.fl_str_mv Informs
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269968398286848
score 13.13397

Publicaciones similares