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

Decomposition and local search based methods for the traveling umpire problem

Author

Listed:
  • Wauters, Tony
  • Van Malderen, Sam
  • Vanden Berghe, Greet

Abstract

The Traveling Umpire Problem (TUP) is a challenging combinatorial optimization problem based on scheduling umpires for Major League Baseball. The TUP aims at assigning umpire crews to the games of a fixed tournament, minimizing the travel distance of the umpires. The present paper introduces two complementary heuristic solution approaches for the TUP. A new method called enhanced iterative deepening search with leaf node improvements (IDLI) generates schedules in several stages by subsequently considering parts of the problem. The second approach is a custom iterated local search algorithm (ILS) with a step counting hill climbing acceptance criterion. IDLI generates new best solutions for many small and medium sized benchmark instances. ILS produces significant improvements for the largest benchmark instances. In addition, the article introduces a new decomposition methodology for generating lower bounds, which improves all known lower bounds for the benchmark instances.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:238:y:2014:i:3:p:886-898
    DOI: 10.1016/j.ejor.2014.04.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714003853
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.04.043?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. 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.
    2. James R. Evans, 1988. "A Microcomputer-Based Decision Support System for Scheduling Umpires in the American Baseball League," Interfaces, INFORMS, vol. 18(6), pages 42-51, December.
    3. 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.
    4. Lamghari, Amina & Ferland, Jacques A., 2011. "Assigning judges to competitions of several rounds using Tabu search," European Journal of Operational Research, Elsevier, vol. 210(3), pages 694-705, May.
    5. 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.
    6. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. Ö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.
    3. 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.
    4. 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.

    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. 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 1-8, June.
    2. 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.
    3. Ö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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Lamghari, Amina & Ferland, Jacques A., 2011. "Assigning judges to competitions of several rounds using Tabu search," European Journal of Operational Research, Elsevier, vol. 210(3), pages 694-705, May.
    9. 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.
    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. Alan T. Murray & Antonio Ortiz & Seonga Cho, 2022. "Enhancing strategic defensive positioning and performance in the outfield," Journal of Geographical Systems, Springer, vol. 24(2), pages 223-240, April.
    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. Marjorie Cone Saur & Kaleigh Starr & Mark Husted & Alexandra M. Newman, 2012. "Scheduling Softball Series in the Rocky Mountain Athletic Conference," Interfaces, INFORMS, vol. 42(3), pages 296-309, June.
    14. 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.
    15. Michael J. Fry & Jeffrey W. Ohlmann, 2012. "Introduction to the Special Issue on Analytics in Sports, Part II: Sports Scheduling Applications," Interfaces, INFORMS, vol. 42(3), pages 229-231, June.
    16. Zachary Steever & Chase Murray & Junsong Yuan & Mark Karwan & Marco Lübbecke, 2022. "An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1849-1870, July.
    17. 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.
    18. Federico Della Croce & Gabriele Dragotto & Rosario Scatamacchia, 2022. "On fairness and diversification in WTA and ATP tennis tournaments generation," Annals of Operations Research, Springer, vol. 316(2), pages 1107-1119, September.
    19. M B Wright, 2007. "Case study: problem formulation and solution for a real-world sports scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 439-445, April.
    20. M B Wright, 2009. "50 years of OR in sport," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 161-168, May.

    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:238:y:2014:i:3:p:886-898. 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.