IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v255y2016i3p948-960.html
   My bibliography  Save this article

An optimization approach to designing a baseball scout network

Author

Listed:
  • Özlü, Oğuzhan
  • Sokol, Joel

Abstract

We study the problem of assigning and scheduling minor league scouts for Major League Baseball (MLB) teams. There are multiple objectives in this problem. We formulate the problem as an integer program, use decomposition and both column-generation-based and problem-specific heuristics to solve it, and evaluate policies on multiple objective dimensions based on 100 bootstrapped season schedules. Our approach can allow teams to improve operationally by finding better scout schedules, to understand quantitatively the strategic tradeoffs inherent in scout assignment policies, and to select the assignment policy whose strategic and operational performance best meets their needs.

Suggested Citation

  • Özlü, Oğuzhan & Sokol, Joel, 2016. "An optimization approach to designing a baseball scout network," European Journal of Operational Research, Elsevier, vol. 255(3), pages 948-960.
    • Handle: RePEc:eee:ejores:v:255:y:2016:i:3:p:948-960
    DOI: 10.1016/j.ejor.2016.05.060
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716304143
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.05.060?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Toffolo, Túlio A.M. & Wauters, Tony & Van Malderen, Sam & Vanden Berghe, Greet, 2016. "Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem," European Journal of Operational Research, Elsevier, vol. 250(3), pages 737-744.
    2. Wauters, Tony & Van Malderen, Sam & Vanden Berghe, Greet, 2014. "Decomposition and local search based methods for the traveling umpire problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 886-898.
    3. de Oliveira, Lucas & de Souza, Cid C. & Yunes, Tallys, 2014. "Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic," European Journal of Operational Research, Elsevier, vol. 236(2), pages 592-600.
    4. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
    5. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    6. Michael A. Trick & Hakan Yildiz & Tallys Yunes, 2012. "Scheduling Major League Baseball Umpires and the Traveling Umpire Problem," Interfaces, INFORMS, vol. 42(3), pages 232-244, June.
    7. George L. Nemhauser & Michael A. Trick, 1998. "Scheduling A Major College Basketball Conference," Operations Research, INFORMS, vol. 46(1), pages 1-8, February.
    8. Adam Farmer & Jeffrey S. Smith & Luke T. Miller, 2007. "Scheduling Umpire Crews for Professional Tennis Tournaments," Interfaces, INFORMS, vol. 37(2), pages 187-196, April.
    9. Xue, Li & Luo, Zhixing & Lim, Andrew, 2015. "Two exact algorithms for the traveling umpire problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 932-943.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Toffolo, Túlio A.M. & Wauters, Tony & Van Malderen, Sam & Vanden Berghe, Greet, 2016. "Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem," European Journal of Operational Research, Elsevier, vol. 250(3), pages 737-744.
    2. Guillermo Durán, 2021. "Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 125-155, April.
    3. Wauters, Tony & Van Malderen, Sam & Vanden Berghe, Greet, 2014. "Decomposition and local search based methods for the traveling umpire problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 886-898.
    4. Xue, Li & Luo, Zhixing & Lim, Andrew, 2015. "Two exact algorithms for the traveling umpire problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 932-943.
    5. Túlio A. M. Toffolo & Jan Christiaens & Frits C. R. Spieksma & Greet Vanden Berghe, 2019. "The sport teams grouping problem," Annals of Operations Research, Springer, vol. 275(1), pages 223-243, April.
    6. Michael A. Trick & Hakan Yildiz & Tallys Yunes, 2012. "Scheduling Major League Baseball Umpires and the Traveling Umpire Problem," Interfaces, INFORMS, vol. 42(3), pages 232-244, June.
    7. van Doornmalen, Jasper & Hojny, Christopher & Lambers, Roel & Spieksma, Frits C.R., 2023. "Integer programming models for round robin tournaments," European Journal of Operational Research, Elsevier, vol. 310(1), pages 24-33.
    8. Bender Marco & Westphal Stephan, 2016. "A combined approximation for the traveling tournament problem and the traveling umpire problem," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 12(3), pages 139-149, September.
    9. Mancini Simona & Isabello Andrea, 2014. "Fair referee assignment for the Italian soccer serieA," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 10(2), pages 153-160, June.
    10. Yun-Chia Liang & Yen-Yu Lin & Angela Hsiang-Ling Chen & Wei-Sheng Chen, 2021. "Variable Neighborhood Search for Major League Baseball Scheduling Problem," Sustainability, MDPI, vol. 13(7), pages 1-18, April.
    11. de Oliveira, Lucas & de Souza, Cid C. & Yunes, Tallys, 2014. "Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic," European Journal of Operational Research, Elsevier, vol. 236(2), pages 592-600.
    12. Trick, Michael A. & Yildiz, Hakan, 2012. "Locally Optimized Crossover for the Traveling Umpire Problem," European Journal of Operational Research, Elsevier, vol. 216(2), pages 286-292.
    13. Elizabeth L. Bouzarth & Benjamin C. Grannan & John M. Harris & Kevin R. Hutson, 2022. "Scheduling the Valley Baseball League," Interfaces, INFORMS, vol. 52(2), pages 189-197, March.
    14. J. Paul Brooks, 2012. "The Court of Appeals of Virginia Uses Integer Programming and Cloud Computing to Schedule Sessions," Interfaces, INFORMS, vol. 42(6), pages 544-553, December.
    15. Guillermo Durán & Mario Guajardo & Facundo Gutiérrez, 2022. "Efficient referee assignment in Argentinean professional basketball leagues using operations research methods," Annals of Operations Research, Springer, vol. 316(2), pages 1121-1139, September.
    16. Michael A. Trick & Hakan Yildiz, 2011. "Benders' cuts guided large neighborhood search for the traveling umpire problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 771-781, December.
    17. Sumitkumar, Rathor & Al-Sumaiti, Ameena Saad, 2024. "Shared autonomous electric vehicle: Towards social economy of energy and mobility from power-transportation nexus perspective," Renewable and Sustainable Energy Reviews, Elsevier, vol. 197(C).
    18. Briskorn, Dirk & Horbach, Andrei, 2009. "A Lagrangian approach for minimum cost tournaments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 647, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Jaeseob Han & Seung-Hyun Jeon & Gyeong-Ho Lee & Sangdon Park & Jun-Kyun Choi, 2023. "Power and Frequency Band Allocation Mechanisms for WPT System with Logarithmic-Based Nonlinear Energy Harvesting Model," Sustainability, MDPI, vol. 15(13), pages 1-27, July.
    20. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:255:y:2016:i:3:p:948-960. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.