Skip to main content
SpringerLink
Log in

A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy

  • Conference paper
Hybrid Metaheuristics (HM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4771))

Included in the following conference series:

Abstract

Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with different qualifications and availabilities should be assigned to a set of games already scheduled. We extend and improve a previous three-phase approach for this problem, based on a constructive heuristic, a repair heuristic to make the initial solutions feasible, and an ILS improvement heuristic. We propose a new constructive algorithm based on a greedy criterion to build initial solutions. Furthermore, we develop a hybridization strategy in which a mixed integer programming exact algorithm replaces the original neighborhood-based local search within the ILS heuristic. Computational experiments are performed for large realistic instances. The use of time-to-target-solution-value plots is emphasized in the evaluation of the numerical results, illustrating the efficiency and the robustness of the new approach. The proposed hybridization of MIP with local search can be extended to other metaheuristics and applications, opening a new research avenue to more robust algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics 8, 343–373 (2002)

    Article  MATH  Google Scholar 

  2. Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. Journal of Scheduling 9, 177–193 (2006)

    Article  MATH  Google Scholar 

  3. Buriol, L.S., Resende, M.G.C., Ribeiro, C.C., Thorup, M.: A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 46, 36–56 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dinitz, J.H., Stinson, D.R.: On assigning referees to tournament schedules. Bulletin of the Institute of Combinatorics and its Applications 44, 22–28 (2005)

    MATH  MathSciNet  Google Scholar 

  5. Duarte, A.R.: Challenge referee assignment problem instances, last visited on (May 23, 2007), Online document at http://www.esportemax.org/rapopt

  6. Duarte, A.R., Ribeiro, C.C., Urrutia, S.: Referee assignment in sports tournaments. In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, pp. 394–397 (2006)

    Google Scholar 

  7. Duarte, A.R., Ribeiro, C.C., Urrutia, S., Haeusler, E.H.: Referee assignment in sport leagues. Lecture Notes in Computer Science (to appear)

    Google Scholar 

  8. Easton, K., Nemhauser, G.L., Trick, M.: Sports scheduling. In: Leung, J.T. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 52.1–52.19. CRC Press, Boca Raton, USA (2004)

    Google Scholar 

  9. Easton, K., Nemhauser, G.L., Trick, M.A.: The traveling tournament problem: Description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 580–585. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Evans, J.R.: A microcomputer-based decision support system for scheduling umpires in the American baseball league. Interfaces 18, 42–51 (1988)

    Google Scholar 

  11. Evans, J.R., Hebert, J.E., Deckro, R.F.: Play ball - The scheduling of sports officials. Perspectives in Computing 4, 18–29 (1984)

    Google Scholar 

  12. Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Operations Research 42, 860–878 (1994)

    MATH  Google Scholar 

  13. Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the MAX-CUT problem. Optimization Methods and Software 7, 1033–1058 (2002)

    Article  MathSciNet  Google Scholar 

  14. Fischetti, M., Lodi, A.: MIP models for MIP heuristics. In: Talk presented at Matheuristics 2006: 1st Workshop on Mathematical Contributions to Metaheuristics, Bertinoro (2006)

    Google Scholar 

  15. Gent, I.P., Hoos, H.H., Rowley, A.G.D., Smyth, K.: Using stochastic local search to solve quantified Boolean formulae. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 348–362. Springer, Heidelberg (2003)

    Google Scholar 

  16. Hoos, H.H., Stützle, T.: Evaluating Las Vegas algorithms - Pitfalls and remedies. In: Proceedings of the 14th Annual Conference on Uncertainty in Artificial Intelligence, pp. 238–245 (1998)

    Google Scholar 

  17. Hoos, H.H., Stützle, T.: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artificial Intelligence 112, 213–232 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  18. Hoos, H.H., Stützle, T.: Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning 24, 421–481 (2000)

    Article  MATH  Google Scholar 

  19. Lourenço, H.P., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321–353. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  20. Martin, O., Otto, S.W.: Combining simulated annealing with local search heuristics. Annals of Operations Research 63, 57–75 (1996)

    Article  MATH  Google Scholar 

  21. Nemhauser, G.L., Trick, M.A.: Scheduling a major college basketball conference. Operations Research 46, 1–8 (1997)

    Article  Google Scholar 

  22. Rasmussen, R.V., Trick, M.A.: Round robin scheduling - A survey. Technical report, Department of Operations Research, University of Aarhus (2006)

    Google Scholar 

  23. Resende, M.G.C., Ribeiro, C.C.: A GRASP with path-relinking for private virtual circuit routing. Networks 41, 104–114 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  24. Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219–249. Kluwer Academic Publishers, Dordrecht (2003)

    Chapter  Google Scholar 

  25. Resende, M.G.C., Ribeiro, C.C.: Parallel Greedy Randomized Adaptive Search Procedures. In: Alba, E. (ed.) Parallel Metaheuristics: A new class of algorithms, pp. 315–346. Wiley, Chichester (2005)

    Chapter  Google Scholar 

  26. Ribeiro, C.C., Rosseti, I.: Efficient parallel cooperative implementations of GRASP heuristics. Parallel Computing 33, 21–35 (2007)

    Article  MathSciNet  Google Scholar 

  27. Ribeiro, C.C., Urrutia, S.: OR on the ball: Applications in sports scheduling and management. OR/MS Today 31, 50–54 (2004)

    Google Scholar 

  28. Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. International Transactions in Operational Research 12, 375–386 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  29. Wright, M.B.: Scheduling English cricket umpires. Journal of the Operational Research Society 42, 447–452 (1991)

    Article  Google Scholar 

  30. Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. European Journal of Operational Research 179, 775–787 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Catholic University of Rio de Janeiro, Rua Marquês de São Vicente 225, Rio de Janeiro, RJ 22453-900, Brazil

    Alexandre R. Duarte

  2. Department of Computer Science, Universidade Federal Fluminense, Rua Passo da Pátria 156, Niterói, RJ 24210-240, Brazil

    Celso C. Ribeiro

  3. Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antônio Carlos 6627, Belo Horizonte, MG 31270-010, Brazil

    Sebastián Urrutia

Authors
  1. Alexandre R. Duarte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sebastián Urrutia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Bartz-Beielstein María José Blesa Aguilera Christian Blum Boris Naujoks Andrea Roli Günter Rudolph Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duarte, A.R., Ribeiro, C.C., Urrutia, S. (2007). A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy. In: Bartz-Beielstein, T., et al. Hybrid Metaheuristics. HM 2007. Lecture Notes in Computer Science, vol 4771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75514-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75514-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75513-5

  • Online ISBN: 978-3-540-75514-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation