Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bhadury, J., Mighty, E. J., & Damar, H. (2000). Maximizing workforce diversity in project teams: a network flow approach. Omega, 28, 143–153.
Duarte, A. R., Ribeiro, C. C., & Urrutia, S. (2006). Referee assignment in sports tournaments. In Proc. of the 6th international conference on the practice and theory of automated timetabling PATAT, Brno, Czech Republic, pp. 394–397.
Duarte, A. R., Ribeiro, C. C., & Urrutia, S. (2007a). A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy. Lecture Notes in Computer Science, 4771, 82–95.
Duarte, A. R., Ribeiro, C. C., Urrutia, S., & Haeusler, E. H. (2007b). Referee assignment in sports leagues. Lecture Notes in Computer Science, 3867, 158–173.
Dumais, S. T., & Nielsen, J. (1992). Automating the assignment of submitted manuscripts to reviewers. In Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval, Copenhagen, Denmark, pp. 233–244.
Evans, J. R. (1988). A microcomputer-based decision support system for scheduling umpires in the American baseball league. Interfaces, 18(6), 42–51.
Evans, J. R., Hebert, J. E., & Deckro, R. F. (1984). Play ball! – the scheduling of sports officials. Perspectives in Computing, 4(1), 18–29.
Glover, F., & Laguna, M. (1998). Tabu search. Boston: Kluwer.
Goldberg, D. E. (1989). Genetic algorithm in search, optimization, and machine learning. Reading: Addison Wesley.
Goldsmith J., & Sloan, R. H. (2007, to appear). The AI conference paper assignment problem. In Proc. AAAI 2007 workshop on preference handling for artificial intelligence.
Hansen, P. (1986). The steepest ascent mildest descent heuristic for combinatorial programming. Presented at Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy.
Hansen, P., & Mladenovic, N. (2001). Variable neighborhood search: principles and applications. European Journal of Operational Research, 130, 449–467.
Hartvigsen, D., Wei, J. C., & Czuchlewski, R. (1999). The conference paper-reviewer assignment problem. Decision Sciences, 30(3), 865–876.
Kuo, C. C., Glover, F., & Dhir, K. S. (1993). Analysis and modeling the maximum diversity problem by zero-one programming. Decision Sciences, 24, 1171–1185.
Lamghari, A., & Ferland, J. A. (2007). Structured neighborhood Tabu search for assigning judges to competitions. In D. Srinivasan (Ed.), Proc. of IEEE symposium on computational intelligence in scheduling (CI-Sched 2007) (pp. 238–245). Honolulu.
Lamghari, A., & Ferland, J. A. (2005). Heuristic techniques to assign judges in competitions. In V. Prahlad, W. W. Tan, A. P. Loh (Eds.), Proc. of the third international conference on computational intelligence, robotics and autonomous System (CIRAS), Singapore.
Landa-Silva, D., & Burke, E. K. (2007). Asynchronous cooperative local search for the office space allocation problem. INFORMS Journal on Computing, 19(4), 575–587.
Sampson, S. E. (2006). Optimization of volunteer labor assignments. Journal of Operations Management, 24, 363–377.
Schirrer, A., Doerner, K. F., & Hartl, R. F. (2007). Reviewer assignment for scientific articles using memetic algorithms. In K. F. Doerner, M. Gendreau, P. Greistorfer, W. Gutjahr, R. F. Hartl, & M. Reimann (eds.), Metaheuristics, progress in complex optimization systems (pp. 113–134). New York: Springer.
Sun, Y., Ma, J., Fan, Z., & Wang, J. (2008). A hybrid knowledge and model approach for reviewer assignment. Expert Systems with Applications, 34(2), 817–824.
Syswerda, G. (1989). Uniform crossover in genetic algorithms. In Schaffer, J.D. (Ed.) Proc. of the third international conference on genetic algorithms (pp. 2–9). San Mateo: Morgan Kaufmann.
Taillard, E. (1991). Robust Tabu search for the quadratic assignment problem. Parallel Computing 17, 443–455.
Weitz, R. R., & Lakshminarayanan, S. (1998). An empirical comparison of heuristic methods for creating maximally diverse groups. Journal of Operational Research Society, 49, 635–646.
Wright, M. B. (1991). Scheduling english cricket umpires. Journal of the Operational Research Society, 42(6), 447–452.
Yavuz, M., Inan, U. H., & Figlali, A. (2008). Fair referee assignments for professional football leagues. Computers and Operations Research 35, 2937–2951.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lamghari, A., Ferland, J.A. Metaheuristic methods based on Tabu search for assigning judges to competitions. Ann Oper Res 180, 33–61 (2010). https://doi.org/10.1007/s10479-008-0498-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0498-8