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 条
  • [1] Heuristics for the mirrored traveling tournament problem
    Ribeiro, Celso C.
    Urrutia, Sebastian
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) : 775 - 787
  • [2] Mirrored traveling tournament problem: An evolutionary approach
    Biajoli, Fabricio Lacerda
    Nogueira Lorena, Luiz Antonio
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA-SBIA 2006, PROCEEDINGS, 2006, 4140 : 208 - 217
  • [3] New models for the Mirrored Traveling Tournament Problem
    Moreira de Carvalho, Marco Antonio
    Nogueira Lorena, Luiz Antonio
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 63 (04) : 1089 - 1095
  • [4] A Hybrid Biogeography Based Heuristic for the Mirrored Traveling Tournament Problem
    Gupta, Daya
    Goel, Lavika
    Aggarwal, Vipin
    [J]. 2013 SIXTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3), 2013, : 325 - 330
  • [5] Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
    Urrutia, Sebastian
    Ribeiro, Celso C.
    [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (13) : 1932 - 1938
  • [6] Solving mirrored traveling tournament problem benchmark instances with eight teams
    Cheung, K. K. H.
    [J]. DISCRETE OPTIMIZATION, 2008, 5 (01) : 138 - 143
  • [7] A Benders approach for computing lower bounds for the mirrored traveling tournament problem
    Cheung, Kevin K. H.
    [J]. DISCRETE OPTIMIZATION, 2009, 6 (02) : 189 - 196
  • [8] Particle Swarm Algorithm for Improved Handling of the Mirrored Traveling Tournament Problem
    Tole, Kevin
    Milani, Muhammed
    Mwakondo, Fullgence
    [J]. TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2021, 28 (05): : 1647 - 1653
  • [9] DFS* and the Traveling Tournament Problem
    Uthus, David C.
    Riddle, Patricia J.
    Guesgen, Hans W.
    [J]. INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, PROCEEDINGS, 2009, 5547 : 279 - +
  • [10] Complexity of the traveling tournament problem
    Thielen, Clemens
    Westphal, Stephan
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 345 - 351
12345