×

Scheduling Argentina’s professional basketball leagues: a variation on the travelling tournament problem. (English) Zbl 1430.90391

Summary: Operations research methods are applied to design the season schedules of Argentina’s professional basketball leagues using a format adopted in 2014 by the top two divisions. Following the setup used by the National Basketball Association (NBA) in North America, games are played any day of the week and away games are scheduled in road trips of one to four consecutive games. The main scheduling objective is to reduce the teams’ total travel distance compared to previous season formats through the use of predetermined trips submitted by the teams. The mathematical form of the problem is a variation on the well-known travelling tournament problem. The modelling is divided into two successive stages, the first one defining the sequences in which each team plays the other teams and the second one assigning the days on which each game is played. Both stages use integer programming models that incorporate a series of constraints reflecting criteria requested by the Argentine Basketball Club Association. Implementation of the models has generated average travel distance reductions of more than 30% per away game, with consequential benefits in lower travel costs and less player fatigue.

MSC:

90B90 Case-oriented studies in operations research
90B35 Deterministic scheduling theory in operations research
90C10 Integer programming
Full Text: DOI

References:

[1] Atan, T.; Çavdaroğlu, B., Minimization of rest mismatches in round robin tournaments, Computers & Operations Research, 99, 78-89 (2018) · Zbl 1458.90251
[2] Bao, R., Time relaxed round robin tournament and the NBA scheduling problem. Ph.D. thesis (2009), Cleveland State University
[3] Bean, J.; Birge, J., Reducing travelling costs and player fatigue in the National Basketball Association, Interfaces, 10, 98-102 (1980)
[4] Bhattacharyya, R., Complexity of the unconstrained traveling tournament problem, Operations Research Letters, 44, 5, 649-654 (2016) · Zbl 1408.90122
[5] Bonomo, F.; Cardemil, A.; Durán, G.; Marenco, J.; Sabán, D., An application of the traveling tournament problem: The Argentine volleyball league, Interfaces, 42, 245-259 (2012)
[6] Brandao, F.; Pedroso, J. P., A complete search method for the relaxed traveling tournament problem, EURO J Comput Optim, 2, 77-86 (2014) · Zbl 1305.90174
[7] Campbell, R. T.; Chen, D., A minimum distance basketball scheduling problem, Management science in sports, 4, 15-26 (1976) · Zbl 0384.90055
[8] Costa, D., An evolutionary tabu search algorithm and the NHL scheduling problem, INFOR: Information Systems and Operational Research, 33, 3, 161-178 (1995) · Zbl 0833.90095
[9] Craig, S.; While, L.; Barone, L., Scheduling for the national hockey league using a multi-objective evolutionary algorithm, Proceedings of the Australasian joint conference on artificial intelligence, 381-390 (2009), Springer
[10] Durán, G.; Guajardo, M.; Miranda, J.; Sauré, D.; Souyris, S.; Weintraub, A.; Wolf, R., Scheduling the Chilean soccer league by integer programming, Interfaces, 37, 539-552 (2007)
[11] Durán, G.; Guajardo, M.; Sauré, J. M.D., Scheduling the South American qualifiers to the 2018 FIFA world cup by integer programming, European Journal of Operational Research, 262, 3, 1109-1115 (2017) · Zbl 1375.90184
[12] Easton, K.; Nemhauser, G.; Trick, M., The traveling tournament problem description and benchmarks, Principles and practice of constraint programming-CP 2001, 580-584 (2001), Springer · Zbl 1067.68627
[13] Easton, K.; Nemhauser, G.; Trick, M., Solving the travelling tournament problem: A combined integer programming and constraint programming approach, (Burke, E.; Causmaecker, P., Practice and theory of automated timetabling IV. Practice and theory of automated timetabling IV, Lecture Notes in Computer Science, 2740 (2003), Springer), 100-109
[14] Fleurent, C.; Ferland, J., Allocating games for the NHL using integer programming, Operations Research, 41, 649-654 (1993) · Zbl 0800.90668
[15] Goossens, D.; Spieksma, F., Scheduling the Belgian soccer league, Interfaces, 39, 109-118 (2009)
[16] INFORMS (2016). O.R. transforms scheduling of Chilean soccer leagues and South American World Cup qualifiers. Accessed May 31, 2016 https://www.pathlms.com/informs/events/533/thumbnail_video_presentations/26171; INFORMS (2016). O.R. transforms scheduling of Chilean soccer leagues and South American World Cup qualifiers. Accessed May 31, 2016 https://www.pathlms.com/informs/events/533/thumbnail_video_presentations/26171
[17] Knust, S., Scheduling non-professional table-tennis leagues, European Journal of Operational Research, 200, 2, 358-367 (2010) · Zbl 1177.90167
[18] Kyngäs, J.; Nurmi, K.; Kyngäs, N.; Lilley, G.; Salter, T.; Goossens, D., Scheduling the Australian football league, Journal of the Operational Research Society, 68, 8, 973-982 (2017)
[19] Nemhauser, G. L.; Trick, M. A., Scheduling a major college basketball conference, Operations Research, 46, 1-8 (1998)
[20] Rasmussen, R. V., Scheduling a triple round robin tournament for the best Danish soccer league, European Journal of Operational Research, 185, 795-810 (2008) · Zbl 1137.90513
[21] Ribeiro, C. C.; Urrutia, S., Scheduling the Brazilian soccer tournament: Solution approach and practice, Interfaces, 42, 260-272 (2012)
[22] Thielen, C.; Westphal, S., Complexity of the traveling tournament problem, Theoretical Computer Science, 412, 345-351 (2011) · Zbl 1230.90102
[23] Trick, M. (2016). Challenge traveling tournament instances. Retrieved June 7, 2016, http://mat.gsia.cmu.edu/TOURN; Trick, M. (2016). Challenge traveling tournament instances. Retrieved June 7, 2016, http://mat.gsia.cmu.edu/TOURN
[24] Urrutia, S.; Ribeiro, C. C., Maximizing breaks and bounding solutions to the mirrored traveling tournament problem, Discrete Applied Mathematics, 154, 13, 1932-1938 (2006) · Zbl 1113.90138
[25] Westphal, S., Scheduling the German basketball league, Interfaces, 44, 498-508 (2014)
[26] Willis, R. J.; Terrill, B. J., Scheduling the Australian state cricket season using simulated annealing, Journal of the Operational Research Society, 45, 3, 276-280 (1994) · Zbl 0800.90664
[27] Wright, M., Timetabling county cricket fixtures using a form of tabu search, Journal of the operational research society, 45, 7, 758-770 (1994)
[28] Wright, M., Scheduling fixtures for New Zealand cricket, IMA Journal of Management Mathematics, 16, 99-112 (2005) · Zbl 1078.90538
[29] Wright, M., Scheduling fixtures for basketball in New Zealand, Computers and Operations Research, 33, 1875-1893 (2006) · Zbl 1090.90096
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.