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

被引：0
|
作者：
Guilera, Bruno [1 ]
Teixeira, Italo [1 ]
Januario, Tiago [1 ]
机构：
[1] Univ Fed Bahia, Dept Ciencia Comp, Computat Intelligence & Optimizat Res Lab CInO, Ave Adhemar de Barros S-N, BR-40170110 Salvador, BA, Brazil
来源：
2018 XLIV LATIN AMERICAN COMPUTER CONFERENCE (CLEI 2018) | 2018年
关键词：
Combinatorial optimization; Graph theory; Heuristics; Sports scheduling;
D O I：
10.1109/CLEI.2018.00028
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：167 / 175
页数：9
相关论文
共 50 条
  • [41] A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
    Siemann, Marije R.
    Walter, Matthias
    [J]. Discrete Optimization, 2022, 46
  • [42] A 2.75-approximation algorithm for the unconstrained traveling tournament problem
    Shinji Imahori
    Tomomi Matsui
    Ryuhei Miyashiro
    [J]. Annals of Operations Research, 2014, 218 : 237 - 247
  • [43] A COOPERATIVE LOCAL SEARCH METHOD FOR SOLVING THE TRAVELING TOURNAMENT PROBLEM
    Khelifa, Meriem
    Boughaci, Dalila
    [J]. COMPUTING AND INFORMATICS, 2018, 37 (06) : 1386 - 1410
  • [44] Approximating the Traveling Tournament Problem with Maximum Tour Length 2
    Thielen, Clemens
    Westphal, Stephan
    [J]. ALGORITHMS AND COMPUTATION, PT 2, 2010, 6507 : 303 - 314
  • [45] A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
    Siemann, Marije R.
    Walter, Matthias
    [J]. DISCRETE OPTIMIZATION, 2022, 46
  • [46] Solving the traveling tournament problem with iterative-deepening Aau
    Uthus, David C.
    Riddle, Patricia J.
    Guesgen, Hans W.
    [J]. JOURNAL OF SCHEDULING, 2012, 15 (05) : 601 - 614
  • [47] A Hybrid PSO-SA Algorithm For The Traveling Tournament Problem
    Tajbakhsh, Alireza
    Eshghi, Kourosh
    Shamsi, Azam
    [J]. CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 512 - 518
  • [48] A new branch-and-price algorithm for the traveling tournament problem
    Irnich, Stefan
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (02) : 218 - 228
  • [49] Mathematical modeling and tabu search heuristic for the traveling tournament problem
    Lee, Jin Ho
    Lee, Young Hoon
    Lee, Yuri Ho
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 3, 2006, 3982 : 875 - 884
  • [50] A 2.75-approximation algorithm for the unconstrained traveling tournament problem
    Imahori, Shinji
    Matsui, Tomomi
    Miyashiro, Ryuhei
    [J]. ANNALS OF OPERATIONS RESEARCH, 2014, 218 (01) : 237 - 247
12345