We model the problem of assigning referees to matches of volleyball championships as a combinatorial optimization problem. To solve it, we adapt three local search heuristics and study their behavior as a funtion of their parameters. We show the limitations of these algorithms and that the use of refined initialization algorithms and an "endgame" strategy can significantly enhance their efficiency.
Negar Kiyavash, Sina Akbari, Seyed Jalal Etesami
Adam Teodor Polak, Marek Elias