id: 06047257
dt: j
an: 06047257
au: Trick, Michael A.; Yildiz, Hakan
ti: Benders’ cuts guided large neighborhood search for the traveling umpire
    problem.
so: Nav. Res. Logist. 58, No. 8, 771-781 (2011).
py: 2011
pu: John Wiley \& Sons, Hoboken, NJ
la: EN
cc: 
ut: personnel scheduling; spots; Benders cuts; large neighborhood search
ci: 
li: doi:10.1002/nav.20482
ab: Summary: This article introduces the use of Benders’ cuts to guide a
    large neighborhood search to solve the traveling umpire problem, a
    sports scheduling problem inspired by the real-life needs of the
    officials of a sports league. At each time slot, a greedy matching
    heuristic is used to construct a schedule. When an infeasibility is
    recognized first a single step backtracking is tried to resolve the
    infeasibility. If unsuccessful, Benders’ cuts are generated to guide
    a large neighborhood search to ensure feasibility and to improve the
    solution. Realizing the inherent symmetry present in the problem, a
    large family of cuts are generated and their effectiveness is tested.
    The resulting approach is able to find better solutions to many
    instances of this problem.
rv: