An improved lower bound for the Traveling Salesman constant

被引：1

作者：

Gaudio, Julia ^{[1
]}

Jaillet, Patrick ^{[2
]}

机构：

[1] MIT, Operat Res Ctr, 1 Amherst St, Cambridge, MA 02142 USA

[2] MIT, Dept Elect Engn & Comp Sci, Cambridge, MA 02139 USA

来源：

OPERATIONS RESEARCH LETTERS | 2020年 / 48卷 / 01期

关键词：

Traveling Salesman problem; Geometric probability; Euclidean combinatorial optimization;

D O I：

10.1016/j.orl.2019.11.007

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Let X-1, X-2, ..., X-n be independent uniform random variables on [0, 1](2). Let L(X-1, ..., X-n) be the length of the shortest Traveling Salesman tour through these points. Beardwood et al (1959) showed that there exists a constant beta such that lim(n ->infinity)L(X-1, ..., X-n)/root n=beta almost surely. It was shown that beta >= 0.625. Building upon an approach proposed by Steinerberger (2015), we improve the lower bound to beta >= 0.6277. (C) 2019 Elsevier B.V. All rights reserved.

引用

页码：67 / 70

页数：4

共 50 条

[31] An upper bound for the length of a traveling salesman path in the Heisenberg group
Li, Sean
Schul, Raanan
REVISTA MATEMATICA IBEROAMERICANA, 2016, 32 (02) : 391 - 417
[32] A new upper bound for the traveling salesman problem in cubic graphs
Liskiewicz, Maciej
Schuster, Martin R.
JOURNAL OF DISCRETE ALGORITHMS, 2014, 27 : 1 - 20
[33] A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
Poikonen, Stefan
Golden, Bruce
Wasil, Edward A.
INFORMS JOURNAL ON COMPUTING, 2019, 31 (02) : 335 - 346
[34] Improved Ant Colony Algorithm for Traveling Salesman Problems
Wang, Pei-dong
Tang, Gong-You
Li, Yang
Yang, Xi-Xin
PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 660 - 664
[35] An improved elastic net method for traveling salesman problem
Yi, Junyan
Yang, Gang
Zhang, Zhiqiang
Tang, Zheng
NEUROCOMPUTING, 2009, 72 (4-6) : 1329 - 1335
[36] An Improved Genetic Algorithm for Multiple Traveling Salesman Problem
Zhou, Wei
Li, Yuanzong
2010 2ND INTERNATIONAL ASIA CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS (CAR 2010), VOL 1, 2010, : 493 - 495
[37] An Improved Wild Horse Optimizer for Traveling Salesman Problem
Sayed, Gehad Ismail
Hassanien, Aboul Ella
5TH INTERNATIONAL CONFERENCE ON COMPUTING AND INFORMATICS (ICCI 2022), 2022, : 274 - 279
[38] An improved particle swarm optimization for traveling salesman problem
Liu, Xinmei
Su, Jinrong
Han, Yan
ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2007, 4682 : 803 - 812
[39] GENETICALLY IMPROVED PRESEQUENCES FOR EUCLIDEAN TRAVELING SALESMAN PROBLEMS
TATE, DM
TUNASAR, C
SMITH, AE
MATHEMATICAL AND COMPUTER MODELLING, 1994, 20 (02) : 135 - 143
[40] An Improved Genetic Algorithm for Solving the Traveling Salesman Problem
Chen, Peng
2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 397 - 401

← 1 2 3 4 5 →