Benders' cuts guided large neighborhood search for the traveling umpire problem | Zendy

Trick Michael A. | Zendy; Yildiz Hakan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Benders' cuts guided large neighborhood search for the traveling umpire problem

Author(s) -

Trick Michael A.,

Yildiz Hakan

Publication year - 2011

Publication title -

naval research logistics (nrl)

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.665

H-Index - 68

eISSN - 1520-6750

pISSN - 0894-069X

DOI - 10.1002/nav.20482

Subject(s) - backtracking , mathematical optimization , schedule , computer science , scheduling (production processes) , operations research , heuristic , greedy algorithm , mathematics , operating system

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. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research