Article ID: | iaor20107545 |
Volume: | 180 |
Issue: | 1 |
Start Page Number: | 33 |
End Page Number: | 61 |
Publication Date: | Nov 2010 |
Journal: | Annals of Operations Research |
Authors: | Lamghari Amina, Ferland A |
Keywords: | heuristics: tabu search, programming: assignment |
Two metaheuristic methods based on Tabu search are introduced to assign judges to individual competitions in a tournament. The complexity of the mathematical formulation accounting for the assignment rules, leads us to use such an approach. The first metaheuristic includes two different Tabu searches that are combined with a diversification strategy. The second metaheuristic is applied to a penalized version of the original model formulated as an assignment problem. This metaheuristic is also based on a Tabu search procedure including a diversification strategy driven by the constraints violated. Numerical results are provided to indicate the efficiency of the methods to generate very good solutions.