Referee assignment in the Chilean football league using integer programming and patterns

This article uses integer linear programming to address the referee assignment problem in the First Division of the Chilean professional football league. The proposed approach considers balance in the number of matches each referee must officiate, the frequency of each referee being assigned to a gi...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Alarcón, F.
Otros Autores: Durán, G., Guajardo, M.
Formato: Capítulo de libro
Lenguaje:Inglés
Publicado: 2013
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 03011caa a22004097a 4500
001 PAPER-11200
003 AR-BaUEN
005 20230518204120.0
008 140217s2013 xx ||||fo|||| 00| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-84885503107 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
100 1 |a Alarcón, F. 
245 1 0 |a Referee assignment in the Chilean football league using integer programming and patterns 
260 |c 2013 
270 1 0 |m Alarcón, F.; Departamento de Ingeniería Industrial Universidad de Chile Santiago 8370439 Chileemail: falarcon@ing.uchile.cl 
506 |2 openaire  |e Política editorial 
520 3 |a This article uses integer linear programming to address the referee assignment problem in the First Division of the Chilean professional football league. The proposed approach considers balance in the number of matches each referee must officiate, the frequency of each referee being assigned to a given team, the distance each referee must travel over the course of a season, and the appropriate pairings of referee experience or skill category with the importance of the matches. Two methodologies are studied, one traditional and the other a pattern-based formulation inspired by the home-away patterns for scheduling season match calendars. Both methodologies are tested in real-world and experimental instances, reporting results that improve significantly on the manual assignments. The pattern-based formulation attains major reductions in execution times, solving real instances to optimality in just a few seconds, while the traditional one takes anywhere from several minutes to more than an hour. © 2013 The Authors.  |l eng 
536 |a Article in Press 
593 |a Departamento de Ingeniería Industrial Universidad de Chile Santiago 8370439 Chile 
593 |a Departamento de Matemática e Instituto de Cálculo FCEyN, Universidad de Buenos Aires 
593 |a CONICET Buenos Aires C1428EGA Argentina 
593 |a Department of Business and Management Science NHH Norwegian School of Economics N-5045 Bergen Norway 
690 1 0 |a FOOTBALL 
690 1 0 |a INTEGER LINEAR PROGRAMMING 
690 1 0 |a PATTERNS 
690 1 0 |a REFEREE ASSIGNMENT 
690 1 0 |a SPORTS SCHEDULING 
700 1 |a Durán, G. 
700 1 |a Guajardo, M. 
773 0 |d 2013  |p Int. Trans. Oper. Res.  |x 09696016  |t International Transactions in Operational Research 
856 4 1 |u http://www.scopus.com/inward/record.url?eid=2-s2.0-84885503107&partnerID=40&md5=955748341fc7fe5d0be92c73e93abc0b  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1111/itor.12049  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_09696016_v_n_p_Alarcon  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09696016_v_n_p_Alarcon  |y Registro en la Biblioteca Digital 
961 |a paper_09696016_v_n_p_Alarcon  |b paper  |c PE 
962 |a info:eu-repo/semantics/article  |a info:ar-repo/semantics/artículo  |b info:eu-repo/semantics/publishedVersion 
999 |c 72153