The approximation ratio of the greedy algorithm for the metric traveling salesman problem

被引：6
|
作者：
Brecklinghaus, Judith [1 ]
Hougardy, Stefan [1 ]
机构：
[1] Univ Bonn, Res Inst Discrete Math, D-53113 Bonn, Germany
来源：
OPERATIONS RESEARCH LETTERS | 2015年 / 43卷 / 03期
关键词：
Traveling salesman problem; Greedy algorithm; Clarke-Wright savings heuristic; Approximation algorithm;
D O I：
10.1016/j.orl.2015.02.009
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We prove that the approximation ratio of the greedy algorithm for the metric Traveling Salesman Problem is Theta (log n). Moreover, we prove that the same result also holds for graphic, euclidean, and rectilinear instances of the Traveling Salesman Problem. Finally we show that the approximation ratio of the Clarke-Wright savings heuristic for the metric Traveling Salesman Problem is (9 (log n). (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：259 / 261
页数：3
相关论文
共 50 条
  • [31] Solving the Traveling Salesman Problem using Greedy Sequential Constructive Crossover in a Genetic Algorithm
    Ahmed, Zakir Hussain
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2020, 20 (02): : 99 - 112
  • [32] Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
    Geng, Xiutang
    Chen, Zhihua
    Yang, Wei
    Shi, Deqian
    Zhao, Kai
    [J]. APPLIED SOFT COMPUTING, 2011, 11 (04) : 3680 - 3689
  • [33] A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem
    Tasgetiren, M. Fatih
    Buyukdagli, Ozge
    Kizilay, Damla
    Karabulut, Korhan
    [J]. SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, PT I (SEMCCO 2013), 2013, 8297 : 1 - 12
  • [34] The angular-metric traveling salesman problem
    Aggarwal, A
    Coppersmith, D
    Khanna, S
    Motwani, R
    Schieber, B
    [J]. PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 221 - 229
  • [35] The angular-metric traveling salesman problem
    Aggarwal, A
    Coppersmith, D
    Khanna, S
    Motwani, R
    Schieber, B
    [J]. SIAM JOURNAL ON COMPUTING, 2000, 29 (03) : 697 - 711
  • [36] THE APPROXIMATION RATIO OF THE k-OPT HEURISTIC FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
    Brodowsky, Ulrich A.
    Hougardy, Stefan
    Zhong, Xianghui
    [J]. SIAM JOURNAL ON COMPUTING, 2023, 52 (04) : 841 - 864
  • [37] An O(log n) approximation ratio for the asymmetric traveling salesman path problem
    Chekuri, Chandra
    Pal, Martin
    [J]. APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 95 - 103
  • [38] The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem
    Brodowsky, Ulrich A.
    Hougardy, Stefan
    [J]. 38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
  • [39] Approximation Schemes for the Generalized Traveling Salesman Problem
    Khachai, M. Yu.
    Neznakhina, E. D.
    [J]. PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2017, 299 : 97 - 105
  • [40] Approximation Schemes for the Generalized Traveling Salesman Problem
    M. Yu. Khachai
    E. D. Neznakhina
    [J]. Proceedings of the Steklov Institute of Mathematics, 2017, 299 : 97 - 105
12345