Heuristics for the Mirrored Tournament Traveling Tournament Problem Based on the Home-Away Swap Neighborhood

In this paper we present a detailed experimental analysis of the existing neighborhoods in the literature using a few quality criteria and propose new heuristics for the Mirrored Traveling Tournament Problem. Based on the Home-Away Swap, the proposed heuristics are able to search the solution space from an infeasible solution and obtaining a feasible one in the end. We also describe a estrategy for reduce the amount of visited neighborhoods in the local search process without drastically affect the solution, consequently we managed to obtain feasible solutions with reduced computation time, as shown through empirical analysis.