Optimization in sports is a field of increasing interest. Combinatorial optimization techniques have been applied, for example, to game scheduling and playoff elimination. A common problem usually found in sports management is the assignment of referees to games already scheduled. There are a number of rules and objectives that should be taken into account when referees are assigned to games. We address a simplified version of a referee assignment problem common to many amateur leagues of sports such as soccer, baseball, and basketball. The problem is formulated by integer programming and its decision version is proved to be NP-complete. To tackle real-life large instances of the referee assignment problem, we propose a three-phase heuristic approach based on a constructive procedure, a repair heuristic to make solutions feasible, and a local search heuristic to improve feasible solutions. Numerical results on realistic instances are presented and discussed.
CITATION STYLE
Duarte, A., Ribeiro, C., Urrutia, S., Haeusler, E., Burke, E., & Rudová, H. (2007). Practice and Theory of Automated Timetabling VI. (E. K. Burke & H. Rudová, Eds.) (Vol. 3867, pp. 158–173). Berlin, Heidelberg: Springer Berlin Heidelberg. Retrieved from http://www.springerlink.com/content/g5r5306788v76707/
Mendeley helps you to discover research relevant for your work.