THE STOCHASTIC SCOUTING PROBLEM

Efficiently scouting talented sports players is of key importance in the commercially oriented sports world. Besides being able to recognize talent, it is important to plan the scouting activities given the available time, in order to maximize the potential for scouting talented players. This problem relates to the orienteering problem. In reality, not only are the times required to travel between schools and the times required to scout at these schools uncertain, but also the potential of the sports players is yet to be determined by the scout. The approaches found in the literature do not model all these uncertainties simultaneously. Therefore, we will introduce the stochastic version of the scouting planning problem by extending an existing approach to fit the practical features of this problem. We illustrate the benefits of this new approach using a case study

[1]  Gerard Sierksma.  Computer Support for Coaching and Scouting in Football , 2006 .

[2]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[3]  Twan Dollevoet,et al.  Robust UAV mission planning , 2011, Ann. Oper. Res..

[4]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[5]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[6]  Mark S. Daskin,et al.  The orienteering problem with stochastic profits , 2008 .

[7]  Tom M. Cavalier,et al.  A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[8]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[9]  Nenad Rogulj,et al.  Identification of sport talents using a web-oriented expert system with a fuzzy module , 2009, Expert Syst. Appl..

[10]  Elise Miller-Hooks,et al.  Algorithms for a stochastic selective travelling salesperson problem , 2005, J. Oper. Res. Soc..

[11]  H. L. Ong,et al.  An Integer L-shaped Algorithm for Time-Constrained Traveling Salesman Problem with Stochastic Travel and Service times , 2004, Asia Pac. J. Oper. Res..

[12]  Michel Gendreau,et al.  The orienteering problem with stochastic travel and service times , 2011, Ann. Oper. Res..

[13]  Suzanne van der Ster,et al.  The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared , 2012 .

[14]  William W. Cooper,et al.  Selecting non-zero weights to evaluate effectiveness of basketball players with DEA , 2009, Eur. J. Oper. Res..

[15]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .