Skip to main content
Log in

50 years of OR in sport

  • Special Issue Paper
  • Published:
Journal of the Operational Research Society

Abstract

This paper reviews about 50 years of activity in OR as applied to sports. After some history and an overview, including discussions of what we mean by sport and what we mean by OR, four themes are presented: tactics and strategy, scheduling, forecasting and ‘other’. Within each theme many papers are discussed, showing the wide range of methods used and sports analysed. The issue is then raised of who our clients are and who they ought to be—it is suggested that not nearly enough is done for amateur sport. The paper ends with a conclusion and speculations about the next 50 years.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • Albright SC and Winston W (1978). A probabilistic model of winners' outs versus losers' outs rules in basketball. Opns Res 26(6): 1010–1019.

    Article  Google Scholar 

  • Annis DH (2006). Optimal end-game strategy in basketball. J Quant Anal Sports 2(2): .

  • Armstrong J and Willis RJ (1993). Scheduling the cricket World Cup—A case study. J Opl Res Soc 44(11): 1067–1072.

    Google Scholar 

  • Audas R, Dobson S and Goddard J (2002). The impact of managerial change on team performance in professional sports. J Econ Bus 54(6): 633–650.

    Article  Google Scholar 

  • Barnett T and Clarke SR (2005). Combining player statistics to predict outcomes. IMA J Mngt Math 16: 113–120.

    Article  Google Scholar 

  • Bartsch T, Drexl A and Kröger S (2006). Scheduling the professional soccer leagues of Austria and Germany. Comput Opns Res 33(7): 1907–1937.

    Article  Google Scholar 

  • Bennett PG, Dando MR and Sharp RG (1980). Using hypergames to model difficult social issues: An approach to the case of soccer hooliganism. J Opl Res Soc 31(7): 621–635.

    Article  Google Scholar 

  • Biajoli FL, Souza MJF, Chaves AA, Mine OM, Cabral LAF and Pontes RC (2004). Scheduling the Brazilian soccer championships: A simulated annealing approach. In: Burke E.K. and Trick M.A. (eds). Fifth International Conference on the Practice and Theory of Automated Timetabling :Pittsburgh, USA. Springer-Verlag: Berlin.

    Google Scholar 

  • Boon BH and Sierksma G (2003). Team formation: Matching quality supply and quality demand. Eur J Opl Res 148(2): 277–292.

    Article  Google Scholar 

  • Brimberg J, Hurley WJ and Johnson RE (1999). A punt returner location problem. Opns Res 47(3): 482–487.

    Article  Google Scholar 

  • Briskorn D and Drexl A (2007). A branch-and-price algorithm for scheduling sport leagues. J Opl Res Soc 60: 84–93.

    Article  Google Scholar 

  • Bruinshoofd A and ter Weel B (2003). Manager to go? Performance dips reconsidered with evidence from Dutch football. Eur J Opl Res 148(2): 233–246.

    Article  Google Scholar 

  • Buraimo B, Forrest D and Simmons R (2008). Insights for clubs from modelling match attendance in football. J Opl Res Soc advance online publication 9 January 2008, doi: 10.1057/palgrave.jors.2602549.

  • Carter M and Guthrie G (2004). Cricket interruptus: Fairness and incentive in limited overs cricket matches. J Opl Res Soc 55(8): 822–829.

    Article  Google Scholar 

  • Clarke SR (1988). Dynamic programming in one-day cricket—Optimal scoring rates. J Opl Res Soc 39(4): 331–337.

    Google Scholar 

  • Clarke SR (1993). Computer forecasting of Australian Rules football for a daily newspaper. J Opl Res Soc 44(8): 753–759.

    Article  Google Scholar 

  • Clarke SR and Norman JM (1978). What chance playing up to 10; they may be better if you think again. The Squash Player, July pp 50–51.

  • Clarke SR and Norman JM (1998). When to rush a ‘behind' in Australian Rules football: A dynamic programming approach. J Opl Res Soc 49(5): 530–536.

    Google Scholar 

  • Clarke SR and Norman JM (1999). To run or not to run? Some dynamic programming models in cricket. J Opl Res Soc 50(5): 536–545.

    Article  Google Scholar 

  • Clarke SR and Norman JM (2003). Dynamic programming in cricket: Choosing a night watchman. J Opl Res Soc 54(8): 838–845.

    Article  Google Scholar 

  • Condon EM, Golden BL and Wasil EA (1999). Predicting the success of nations at the summer Olympics using neural networks. Comput Opns Res 26(13): 1243–1265.

    Article  Google Scholar 

  • Cooper WW, Ruiz JL and Sirvent I (2008). Selecting non-zero weights to evaluate effectiveness of basketball players with DEA. Eur J Opl Res 195(2): 563–574.

    Article  Google Scholar 

  • Culpepper C (2007). Up Pompey . Orion Publishing Group: London.

    Google Scholar 

  • Davey RC, Hayes M and Norman JM (1994). Running uphill: An experimental result and its applications. J Opl Res Soc 45(1): 25–29.

    Article  Google Scholar 

  • della Croce F and Oliveri D (2006). Scheduling the Italian Football League: An ILP-based approach. Comput Opns Res 33(7): 1963–1974.

    Article  Google Scholar 

  • della Croce F, Tadei R and Asioli PS (1999). Scheduling a round robin tennis tournament under courts and players availability constraints. Ann Opns Res 92: 349–361.

    Article  Google Scholar 

  • Dixon MJ and Robinson ME (1998). A birth process model for association football matches. Statistician 47: 523–538.

    Google Scholar 

  • Duarte AR, Ribeiro CC, Urrutia S and Haeusler EH (2007). Referee assignment in sports leagues. Lect Notes Comput Sci 3867: 158–173.

    Article  Google Scholar 

  • Duckworth FC and Lewis AJ (1998). A fair method for resetting the target in interrupted one-day cricket matches. J Opl Res Soc 49(3): 220–227.

    Article  Google Scholar 

  • Easton K, Nemhauser GL and Trick MA (2001). The traveling tournament problem: Description and benchmarks. Lect Notes Comput Sci 2239: 580–584.

    Article  Google Scholar 

  • Eiselt HA and Laporte G (1991). A combinatorial optimization problem arising in dartboard design. J Opl Res Soc 42(2): 113–118.

    Article  Google Scholar 

  • Elf M, Jünger M and Rinaldi G (2003). Minimizing breaks by maximizing cuts. Opns Res Lett 31(5): 343–349.

    Article  Google Scholar 

  • Evans JR (1988). A microcomputer-based decision support system for scheduling umpires in the American baseball league. Interfaces 18(6): 42–51.

    Article  Google Scholar 

  • Evans JR, Hebert JE and Deckro RF (1984). Play ball—The scheduling of sports officials. Perspect Comput 4(1): 18–29.

    Google Scholar 

  • Fitt AD, Howls CJ and Kabelka M (2006). Valuation of soccer spread bets. J Opl Res Soc 57(8): 975–985.

    Article  Google Scholar 

  • Fleurent C and Ferland JA (1993). Allocating games for the NHL using integer programming. Opns Res 41(4): 649–654.

    Article  Google Scholar 

  • Flitman AM (2006). Towards probabilistic footy tipping: A hybrid approach utilising genetically defined neural networks and linear programming. Comput Opns Res 33(7): 2003–2022.

    Article  Google Scholar 

  • Freeze RA (1974). An analysis of baseball batting order by Monte Carlo simulation. Opns Res 22(4): 728–735.

    Article  Google Scholar 

  • Gil Lafuente J (2004). The best systems for appointing referees. In: Butenko S., Gil Lafuente J. and Pardalos P.M. (eds). Economics, Management and Optimization in Sports. Springer-Verlag: Berlin, pp. 101–120.

    Chapter  Google Scholar 

  • Glickman ME (2008). Bayesian locally optimal design of knockout tournaments. J Statist Plann Infer 138(7): 2117–2127.

    Article  Google Scholar 

  • Golding M (2002). Tactics and planning in round the world yacht racing. Presented at the OR Society Southern OR Group One-day Event on OR in Sport. Oxford.

    Google Scholar 

  • Hayes M and Norman JM (1984). Dynamic programming in orienteering: Route choice and the siting of controls. J Opl Res Soc 35(9): 791–796.

    Article  Google Scholar 

  • Heazlewood T (2006). Prediction versus reality: The use of mathematical models to predict elite performance in swimming and athletics at the Olympic Games. J Sports Sci Med 5: 541–547.

    Google Scholar 

  • Hersh M and Ladany SP (1989). Optimal pole-vaulting strategy. Opns Res 37(1): 172–175.

    Article  Google Scholar 

  • Hirotsu N and Wright MB (2002). Using a Markov process model of an association football match to determine the optimal timing of substitution and tactical decisions. J Opl Res Soc 53(1): 88–96.

    Article  Google Scholar 

  • Hirotsu N and Wright MB (2003). A Markov chain approach to optimal pinch hitting strategies in a designated hitter rule baseball game. J Opns Res Soc Japan 46(3): 353–371.

    Google Scholar 

  • Hope C (2003). When should you sack a football manager? Results from a simple model applied to the English Premiership. J Opl Res Soc 54(11): 1167–1176.

    Article  Google Scholar 

  • Johns S (2001). Complexity in amateur sports scheduling. Paper Presented at the Operational Research Society Conference. Bath.

    Google Scholar 

  • Kendall GX (2008). Scheduling English football fixtures over holiday periods. J Opl Res Soc 59(6): 743–755.

    Article  Google Scholar 

  • Klaassen FJGM and Magnus JR (2003). Forecasting the winner of a tennis match. Eur J Opl Res 148(2): 257–267.

    Article  Google Scholar 

  • Köhler D (1982). Optimal strategies for the game of darts. J Opl Res Soc 33(10): 871–884.

    Article  Google Scholar 

  • Kostuk KJ, Willoughby KA and Saedt APH (2001). Modelling curling as a Markov process. Eur J Opl Res 133(3): 557–565.

    Article  Google Scholar 

  • Kuper GH and Sterken E (2004) Do skating suits increase average skating speed? Gröningen University Working Paper, http://www.ub.rug.nl/eldoc/ccso/200404.

  • Ladany SP (1975a). Optimal starting height for pole-vaulting. Opns Res 23(5): 968–978.

    Article  Google Scholar 

  • Ladany SP (1975b). Optimization of pentathlon training plans. Mngt Sci 21(10): 1144–1155.

    Article  Google Scholar 

  • Ladany SP and Machol RE (eds) (1977). Optimal Strategies in Sports. North-Holland: New York..

  • Lee KT and Chin St (2004). Strategies to serve or receive the service in volleyball. Math Meth Opns Res 59(1): 53–67.

    Article  Google Scholar 

  • Lewis M (2003). Moneyball: The Art of Winning an Unfair Game . Norton: New York.

    Google Scholar 

  • Lilien (1977). Optimal weightlifting. In: Ladany S.P. and Machol R.E. (eds). Optimal Strategies in Sports. North-Holland: New York, pp. 101–112.

    Google Scholar 

  • Lim A, Rodrigues B and Zhang X (2006). A simulated annealing and hill-climbing algorithm for the traveling tournament problem. Eur J Opl Res 174(3): 1459–1478.

    Article  Google Scholar 

  • Lindsey GR (1963). An investigation of strategies in baseball. Opns Res 11(4): 477–501.

    Article  Google Scholar 

  • Lo VSY, Bacon-Shone J and Busche K (1995). The application of ranking probability models to racetrack betting. Mngt Sci 41(6): 1048–1059.

    Article  Google Scholar 

  • Machol RE and Ladany SP (1976). Management Science in Sports . North-Holland: New York.

    Google Scholar 

  • McGarry T (1998). On the design of sports tournaments. In: Bennett J.M. (ed). Statistics in Sport. Arnold: London, pp. 199–217.

    Google Scholar 

  • Miyashiro R and Matsui T (2006). Semidefinite programming based approaches to the break minimization problem. Comput Opns Res 33(7): 1975–1982.

    Article  Google Scholar 

  • Mottley CM (1954). The application of operations research methods to athletic games. J Opns Res Soc Amer 2(3): 335–338.

    Google Scholar 

  • Nemhauser GL and Trick MA (1998). Scheduling a major college basketball conference. Opns Res 46(1): 1–8.

    Article  Google Scholar 

  • Norman JM (1985). Dynamic programming in tennis—When to use a fast serve. J Opl Res Soc 36(1): 75–77.

    Google Scholar 

  • Norman JM (2004). Running uphill: Energy needs and Naismith's rule. J Opl Res Soc 55(3): 308–311.

    Article  Google Scholar 

  • Norman JM and Clarke SR (2007). Dynamic programming in cricket: Optimizing batting order for a sticky wicket. J Opl Res Soc 58(12): 1678–1682.

    Article  Google Scholar 

  • Nowak M, Epelman M and Pollock SM (2006). Assignment of swimmers to dual meet events. Comput Opns Res 33(7): 1951–1962.

    Article  Google Scholar 

  • Percy DF (2007a). Handicapping systems for disabled Alpine skiing. In: Percy D.F., Scarf P.A. and Robinson C.L. (eds). Proceedings of the 1st International Conference on Mathematical Modelling in Sport :Salford, pp 157–162. Salford University: Salford: UK.

    Google Scholar 

  • Percy DF (2007b). A mathematical analysis of badminton scoring systems. J Opl Res Soc 60: 63–71.

    Article  Google Scholar 

  • Philpott AB, Henderson SG and Teimey D (2004). A simulation model for predicting yacht match race outcomes. Opns Res 52(1): 1–16.

    Article  Google Scholar 

  • Pollock SM (1974). A model for evaluating golf handicapping. Opns Res 22(5): 1040–1050.

    Article  Google Scholar 

  • Rasmussen RV and Trick MA (2007). A Benders approach for the constrained minimum break problem. Eur J Opl Res 177(1): 198–213.

    Article  Google Scholar 

  • Ribeiro CC and Urrutia S (2007). Heuristics for the mirrored traveling tournament problem. Eur J Opl Res 179(3): 775–787.

    Article  Google Scholar 

  • Russell RA and Leung JMY (1994). Devising a cost effective schedule for a baseball league. Opns Res 42(4): 614–625.

    Article  Google Scholar 

  • Saltzman RM and Bradford RM (1996). Optimal realignments of the teams in the National Football League. Eur J Opl Res 93(3): 469–475.

    Article  Google Scholar 

  • Scarf P and Grehan P (2005). An empirical basis for route choice in cycling. J Sports Sci 23(9): 919–925.

    Article  Google Scholar 

  • Scarf P and Xin S (2008). The importance of a match in a tournament. Comput Opns Res 35(7): 2406–2418.

    Article  Google Scholar 

  • Schönberger J, Mattfeld DC and Kopfer H (2004). Memetic algorithm timetabling for non-commercial sport leagues. Eur J Opl Res 153(1): 102–116.

    Article  Google Scholar 

  • Sierksma G (2006). Computer support for coaching and scouting in football. Sports Eng 9(4): 229–249.

    Article  Google Scholar 

  • Silverman D and Schwartz BL (1973). How to win by losing. Opns Res 21(2): 639–643.

    Article  Google Scholar 

  • Spark M (1961). The Prime of Miss Jean Brodie . Macmillan: London.

    Google Scholar 

  • Sphicas GP and Ladany SP (1977). Dynamic policies in the long jump. In: Ladany S.P. and Machol R.E. (eds). Optimal Strategies in Sports. North-Holland: New York, pp. 101–112.

    Google Scholar 

  • Swartz TB, Gill PS, Beaudoin D and deSilva BM (2006). Optimal batting orders in one-day cricket. Comput Opns Res 33(7): 1939–1950.

    Article  Google Scholar 

  • Taylor BW and Keown AJ (1978). Planning urban recreational facilities with integer goal programming. J Opl Res Soc 29(8): 751–758.

    Article  Google Scholar 

  • Tena JD and Forrest D (2007). Within-season dismissal of football coaches: Statistical analysis of causes and consequences. Eur J Opl Res 181(1): 362–373.

    Article  Google Scholar 

  • Thompson J (1999). Kicking timetabling problems into touch. OR Insight 12(3): 7–15.

    Article  Google Scholar 

  • Urban TL and Russell RA (2003). Scheduling sports competitions on multiple venues. Eur J Opl Res 148(2): 302–311.

    Article  Google Scholar 

  • van Voorhis T (2002). Highly constrained college basketball scheduling. J Opl Res Soc 53(6): 603–609.

    Article  Google Scholar 

  • Vasko FJ (2003). Play ball—Equally: Math programming lends a hand to little league baseball. OR Insight 16(2): 16–19.

    Article  Google Scholar 

  • Washburn A (1991). Still more on pulling the goalie. Interfaces 21: 59–64.

    Article  Google Scholar 

  • Willis RJ and Terrill BJ (1994). Scheduling the Australian state cricket season using simulated annealing. J Opl Res Soc 45(3): 276–280.

    Article  Google Scholar 

  • Wright MB (1988). Probabilities and decision rules for the game of squash rackets. J Opl Res Soc 39(1): 91–99.

    Article  Google Scholar 

  • Wright MB (1991). Scheduling English cricket umpires. J Opl Res Soc 42(6): 447–452.

    Article  Google Scholar 

  • Wright MB (1992). A fair allocation of county cricket opponents. J Opl Res Soc 43(3): 195–201.

    Article  Google Scholar 

  • Wright MB (1994). Timetabling county cricket fixtures using a form of tabu search. J Opl Res Soc 45(7): 758–770.

    Article  Google Scholar 

  • Wright MB (2005). Scheduling fixtures for New Zealand Cricket. IMA J Mngt Math 16(2): 99–112.

    Article  Google Scholar 

  • Wright MB (2006). Scheduling fixtures for Basketball New Zealand. Comput Opns Res 33(7): 1875–1893.

    Article  Google Scholar 

  • Wright MB (2007). Case study: Problem formulation and solution for a real-world sports scheduling problem. J Opl Res Soc 58(4): 439–445.

    Article  Google Scholar 

  • Wright MB and Hirotsu N (2003). The professional foul in football—Tactics and deterrents. J Opl Res Soc 54(3): 213–221.

    Article  Google Scholar 

  • Yavuz M, İnan UH and Figˇlalı A (2008). Fair referee assignments for professional football leagues. Comput Opns Res 35(9): 2937–2951.

    Article  Google Scholar 

  • Zakarya Z, Hertz A and de Werra D (1989). Un système informatique pour les calendriers d'arbitrage d'une association sportive. Report of the Départment de mathématiques, École Polytechnique Fédérale de Lausanne, Switzerland..

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M B Wright.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wright, M. 50 years of OR in sport. J Oper Res Soc 60 (Suppl 1), S161–S168 (2009). https://doi.org/10.1057/jors.2008.170

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2008.170

Keywords

Navigation