A multiplier adjustment method for the generalized assignment problem
Management Science
Restrictions of graph partition problems. Part I
Theoretical Computer Science
The ultimate interval graph recognition algorithm?
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The Traveling Tournament Problem Description and Benchmarks
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scheduling a Major College Basketball Conference
Operations Research
A simulated annealing approach to the traveling tournament problem
Journal of Scheduling
Fair referee assignments for professional football leagues
Computers and Operations Research
A hybrid heuristic for the diameter constrained minimum spanning tree problem
Journal of Global Optimization
A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Cricket team selection using evolutionary multi-objective optimization
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
Multi-objective optimization and decision making approaches to cricket team selection
Applied Soft Computing
Hi-index | 0.00 |
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.