An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment

Autores
Recalde, Diego; Severin, Daniel Esteban; Torres, Ramiro; Vaca, Polo
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this work a balanced k-way partitioning problem with weight constraints is defined to model the sports team realignment. Sports teams must be partitioned into a fixed number of groups according to some regulations, where the total distance of the road trips that all teams must travel to play a double round robin tournament in each group is minimized. Two integer programming formulations for this problem are introduced, and the validity of three families of inequalities associated to the polytope of these formulations is proved. The performance of a tabu search procedure and a branch and cut algorithm, which uses the valid inequalities as cuts, is evaluated over simulated and real-world instances. In particular, an optimal solution for the realignment of the Ecuadorian football league is reported and the methodology can be suitable adapted for the realignment of other sports leagues.
Fil: Recalde, Diego. Escuela Politécnica Nacional; Ecuador
Fil: Severin, Daniel Esteban. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Torres, Ramiro. Escuela Politécnica Nacional; Ecuador
Fil: Vaca, Polo. Escuela Politécnica Nacional; Ecuador
Materia
INTEGER PROGRAMMING MODELS
GRAPH PARTITIONING
TABU SEARCH
SPORTS TEAM REALIGNMENT
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by/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/90390
Acceder
id CONICETDig_722838865c1952c0b03738c59ba3975a
oai_identifier_str oai:ri.conicet.gov.ar:11336/90390
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignmentRecalde, DiegoSeverin, Daniel EstebanTorres, RamiroVaca, PoloINTEGER PROGRAMMING MODELSGRAPH PARTITIONINGTABU SEARCHSPORTS TEAM REALIGNMENThttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1In this work a balanced k-way partitioning problem with weight constraints is defined to model the sports team realignment. Sports teams must be partitioned into a fixed number of groups according to some regulations, where the total distance of the road trips that all teams must travel to play a double round robin tournament in each group is minimized. Two integer programming formulations for this problem are introduced, and the validity of three families of inequalities associated to the polytope of these formulations is proved. The performance of a tabu search procedure and a branch and cut algorithm, which uses the valid inequalities as cuts, is evaluated over simulated and real-world instances. In particular, an optimal solution for the realignment of the Ecuadorian football league is reported and the methodology can be suitable adapted for the realignment of other sports leagues.Fil: Recalde, Diego. Escuela Politécnica Nacional; EcuadorFil: Severin, Daniel Esteban. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Torres, Ramiro. Escuela Politécnica Nacional; EcuadorFil: Vaca, Polo. Escuela Politécnica Nacional; EcuadorSpringer2018-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/90390Recalde, Diego; Severin, Daniel Esteban; Torres, Ramiro; Vaca, Polo; An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment; Springer; Journal Of Combinatorial Optimization; 36; 3; 10-2018; 916-9361382-69051573-2886CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://link.springer.com/10.1007/s10878-018-0254-1info:eu-repo/semantics/altIdentifier/doi/10.1007/s10878-018-0254-1info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:41:04Zoai:ri.conicet.gov.ar:11336/90390instacron: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-29 09:41:04.821CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
title An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
spellingShingle An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
Recalde, Diego
INTEGER PROGRAMMING MODELS
GRAPH PARTITIONING
TABU SEARCH
SPORTS TEAM REALIGNMENT
title_short An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
title_full An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
title_fullStr An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
title_full_unstemmed An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
title_sort An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
dc.creator.none.fl_str_mv Recalde, Diego
Severin, Daniel Esteban
Torres, Ramiro
Vaca, Polo
author Recalde, Diego
author_facet Recalde, Diego
Severin, Daniel Esteban
Torres, Ramiro
Vaca, Polo
author_role author
author2 Severin, Daniel Esteban
Torres, Ramiro
Vaca, Polo
author2_role author
author
author
dc.subject.none.fl_str_mv INTEGER PROGRAMMING MODELS
GRAPH PARTITIONING
TABU SEARCH
SPORTS TEAM REALIGNMENT
topic INTEGER PROGRAMMING MODELS
GRAPH PARTITIONING
TABU SEARCH
SPORTS TEAM REALIGNMENT
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In this work a balanced k-way partitioning problem with weight constraints is defined to model the sports team realignment. Sports teams must be partitioned into a fixed number of groups according to some regulations, where the total distance of the road trips that all teams must travel to play a double round robin tournament in each group is minimized. Two integer programming formulations for this problem are introduced, and the validity of three families of inequalities associated to the polytope of these formulations is proved. The performance of a tabu search procedure and a branch and cut algorithm, which uses the valid inequalities as cuts, is evaluated over simulated and real-world instances. In particular, an optimal solution for the realignment of the Ecuadorian football league is reported and the methodology can be suitable adapted for the realignment of other sports leagues.
Fil: Recalde, Diego. Escuela Politécnica Nacional; Ecuador
Fil: Severin, Daniel Esteban. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Torres, Ramiro. Escuela Politécnica Nacional; Ecuador
Fil: Vaca, Polo. Escuela Politécnica Nacional; Ecuador
description In this work a balanced k-way partitioning problem with weight constraints is defined to model the sports team realignment. Sports teams must be partitioned into a fixed number of groups according to some regulations, where the total distance of the road trips that all teams must travel to play a double round robin tournament in each group is minimized. Two integer programming formulations for this problem are introduced, and the validity of three families of inequalities associated to the polytope of these formulations is proved. The performance of a tabu search procedure and a branch and cut algorithm, which uses the valid inequalities as cuts, is evaluated over simulated and real-world instances. In particular, an optimal solution for the realignment of the Ecuadorian football league is reported and the methodology can be suitable adapted for the realignment of other sports leagues.
publishDate 2018
dc.date.none.fl_str_mv 2018-10
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/90390
Recalde, Diego; Severin, Daniel Esteban; Torres, Ramiro; Vaca, Polo; An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment; Springer; Journal Of Combinatorial Optimization; 36; 3; 10-2018; 916-936
1382-6905
1573-2886
CONICET Digital
CONICET
url http://hdl.handle.net/11336/90390
identifier_str_mv Recalde, Diego; Severin, Daniel Esteban; Torres, Ramiro; Vaca, Polo; An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment; Springer; Journal Of Combinatorial Optimization; 36; 3; 10-2018; 916-936
1382-6905
1573-2886
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://link.springer.com/10.1007/s10878-018-0254-1
info:eu-repo/semantics/altIdentifier/doi/10.1007/s10878-018-0254-1
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
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_ 1844613299361021952
score 13.069144

Publicaciones similares