Decomposition and local search based methods for the traveling umpire problem

作者：Wauters Tony^*; Van Malderen Sam; Vanden Berghe Greet

来源：European Journal of Operational Research, 2014, 238(3): 886-898.

DOI：10.1016/j.ejor.2014.04.043

• OR in sports
• Traveling umpire problem
• Heuristics
• Iterated local search
• Decomposition

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.

• 出版日期2014-11-1