An approximation algorithm for the traveling tournament problem

被引：9

作者：

Miyashiro, Ryuhei ^{[1
]}

Matsui, Tomomi ^{[2
]}

Imahori, Shinji ^{[3
]}

机构：

[1] Tokyo Univ Agr & Technol, Inst Engn, Koganei, Tokyo 1848588, Japan

[2] Chuo Univ, Fac Sci & Engn, Bunkyo Ku, Tokyo 1128551, Japan

[3] Univ Tokyo, Grad Sch Informat Sci & Technol, Bunkyo Ku, Tokyo 1138656, Japan

来源：

ANNALS OF OPERATIONS RESEARCH | 2012年 / 194卷 / 01期

关键词：

Traveling tournament problem; Lower bound; Approximation algorithm; Tournament; Timetabling; Scheduling; COMPLEXITY;

D O I：

10.1007/s10479-010-0742-x

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper describes the traveling tournament problem, a well-known benchmark problem in the field of tournament timetabling. We propose a new lower bound for the traveling tournament problem, and construct a randomized approximation algorithm yielding a feasible solution whose approximation ratio is less than 2+(9/4)/(n-1), where n is the number of teams. Additionally, we propose a deterministic approximation algorithm with the same approximation ratio using a derandomization technique. For the traveling tournament problem, the proposed algorithms are the first approximation algorithms with a constant approximation ratio, which is less than 2+3/4.

引用

页码：317 / 324

页数：8

共 50 条

[31] Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2
Zhao, Jingyang
Xiao, Mingyu
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 2024,
[32] 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
[33] 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
[34] 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
[35] A new lower bound to the traveling tournament problem
Urrutia, Sebastian
Ribeiro, Celso C.
Melo, Rafael A.
[J]. 2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING, 2007, : 15 - +
[36] 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
[37] Clustering search approach for the traveling tournament problem
Lacerda Biajoli, Fabricio
Nogueira Lorena, Luiz Antonio
[J]. MICAI 2007: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2007, 4827 : 83 - +
[38] A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
Amano, Yuki
Makino, Kazuhisa
[J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 237 - 248
[39] AN IMPROVED APPROXIMATION ALGORITHM FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM\ast
Traub, Vera
Vygen, Jens
[J]. SIAM JOURNAL ON COMPUTING, 2022, 51 (01) : 139 - 173
[40] The approximation ratio of the greedy algorithm for the metric traveling salesman problem
Brecklinghaus, Judith
Hougardy, Stefan
[J]. OPERATIONS RESEARCH LETTERS, 2015, 43 (03) : 259 - 261

← 1 2 3 4 5 →