A combinatorial optimization formulation for the home away assignment problem

Authors

Keywords:

HA Assignment, Sports scheduling

Abstract

The sports scheduling problem has been center of attention in the Operational Research community due to their variety of models, and computational complexity of solutions (see for example Ribeiro (2010)). In a Round Robin tournament, the schedule is proposed by assigning a “home" or “away" labels to a preestablished itinerary, in a such way that the total distance traveled by the teams during the tournament is minimized. In terms of operation research, the problem is modeled as a binary quadratic programming problem with linear constraints. In Suzuka y cols. (2005) the problem is treated as a MIN-RES-CUT. In this work we study the structure of the home-away assignment problem, and propose a simplification of the combinatorial formulation. We solve exactly small instances of the problem with an exhaustive search, and also approximately solve larger instances with a random search.

Downloads

Download data is not yet available.

Author Biographies

Jorge Perdomo, Universidad Centroccidental Lisandro Alvarado, Venezuela

Maestría en Optimización, DFecanato de Ciencias y Tecnología

Hugo Lara Urdaneta, Universidad Centroccidental Lisandro Alvarado, Venezuela

Departamento de Investigación de Operaciones y Estadística, Decanato de Ciencias y Tecnología

Publicaciones en Ciencias y Tecnologia Vol 7 nro 2 año 2013

Published

2013-11-07

How to Cite

[1]
J. Perdomo and H. Lara Urdaneta, “A combinatorial optimization formulation for the home away assignment problem”, Publ.Cienc.Tecnol, vol. 7, no. 2, pp. 127-141, Nov. 2013.

Issue

Vol. 7 No. 2 (2013): July-December

Section

Research Article

Creative Commons Reconocimiento-NoComercial-CompartirIgual 4.0 Internacional (CC BY-NC-SA 4.0)

The opinions expressed by the authors do not necessarily reflect the position of the publisher of the publication or of UCLA. The total or partial reproduction of the texts published here is authorized, as long as the complete source and the electronic address of this journal are cited.

The authors fully retain the rights to their works, giving the journal the right to be the first publication where the article is presented. The authors have the right to use their articles for any purpose as long as it is done for non-profit. Authors are recommended to disseminate their articles in the final version, after publication in this journal, in the electronic media of the institutions to which they are affiliated or personal digital media.