Clustering search approach for the traveling tournament problem

被引：0
|
作者：
Lacerda Biajoli, Fabricio [1 ]
Nogueira Lorena, Luiz Antonio [1 ]
机构：
[1] INPE, LAC, Av Astronautas 1-758, Sao Jose Dos Campos, SP, Brazil
来源：
MICAI 2007: ADVANCES IN ARTIFICIAL INTELLIGENCE | 2007年 / 4827卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The Traveling Tournament Problem (TTP) is an optimization problem that represents some types of sports timetabling, where the objective is to minimize the total distance traveled by the teams. This work proposes the use of a hybrid heuristic to solve the mirrored TTP (mTTP), called Clustering Search (*CS), that consists in detecting supposed promising search areas based on clustering. The validation of the results will be done in benchmark problems available in literature and real benchmark problems, e.g. Brazilian Soccer Championship.
引用
收藏
页码：83 / +
页数：3
相关论文
共 50 条
  • [1] A combined local search and integer programming approach to the traveling tournament problem
    Marc Goerigk
    Stephan Westphal
    [J]. Annals of Operations Research, 2016, 239 : 343 - 354
  • [2] A composite-neighborhood tabu search approach to the traveling tournament problem
    Luca Di Gaspero
    Andrea Schaerf
    [J]. Journal of Heuristics, 2007, 13 : 189 - 207
  • [3] A combined local search and integer programming approach to the traveling tournament problem
    Goerigk, Marc
    Westphal, Stephan
    [J]. ANNALS OF OPERATIONS RESEARCH, 2016, 239 (01) : 343 - 354
  • [4] A composite-neighborhood tabu search approach to the traveling tournament problem
    Di Gaspero, Luca
    Schaerf, Andrea
    [J]. JOURNAL OF HEURISTICS, 2007, 13 (02) : 189 - 207
  • [5] A complete search method for the relaxed traveling tournament problem
    Brandao, Filipe
    Pedroso, Joao Pedro
    [J]. EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2014, 2 (1-2) : 77 - 86
  • [6] Approaching the Traveling Tournament Problem with Randomized Beam Search
    Frohner, Nikolaus
    Neumann, Bernhard
    Pace, Giulio
    Raidl, Guenther R.
    [J]. EVOLUTIONARY COMPUTATION, 2023, 31 (03) : 233 - 257
  • [7] A simulated annealing approach to the traveling tournament problem
    A. Anagnostopoulos
    L. Michel
    P. Van Hentenryck
    Y. Vergados
    [J]. Journal of Scheduling, 2006, 9 : 177 - 193
  • [8] A simulated annealing approach to the traveling tournament problem
    Anagnostopoulos, A
    Michel, L
    Van Hentenryck, P
    Vergados, Y
    [J]. JOURNAL OF SCHEDULING, 2006, 9 (02) : 177 - 193
  • [9] 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
  • [10] A COOPERATIVE LOCAL SEARCH METHOD FOR SOLVING THE TRAVELING TOURNAMENT PROBLEM
    Khelifa, Meriem
    Boughaci, Dalila
    [J]. COMPUTING AND INFORMATICS, 2018, 37 (06) : 1386 - 1410
12345