Optimal TSP tour length estimation using Sammon maps

被引：0
|
作者：
Kou, Shuhan [1 ]
Golden, Bruce [2 ]
Poikonen, Stefan [3 ]
机构：
[1] Univ Maryland, Dept Math, College Pk, MD 20742 USA
[2] Univ Maryland, Robert H Smith Sch Business, College Pk, MD USA
[3] Univ Colorado, Business Sch, Denver, CO USA
来源：
OPTIMIZATION LETTERS | 2023年 / 17卷 / 01期
关键词：
Traveling salesman problem; Tour length estimation; Regression;
D O I：
10.1007/s11590-022-01937-y
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The optimal tour length of a non-Euclidean traveling salesman problem (TSP) can be estimated using the locations of vertices and the circuity factor. In this paper, we propose a method to estimate the optimal tour length of a non-Euclidean TSP using Sammon mapping. While providing accuracy comparable to the approach using the circuity factor, this new method has a number of advantages.
引用
收藏
页码：89 / 105
页数：17
相关论文
共 50 条
  • [1] Optimal TSP tour length estimation using Sammon maps
    Shuhan Kou
    Bruce Golden
    Stefan Poikonen
    [J]. Optimization Letters, 2023, 17 : 89 - 105
  • [2] Optimal TSP tour length estimation using standard deviation as a predictor
    Kou, Shuhan
    Golden, Bruce
    Poikonen, Stefan
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2022, 148
  • [3] ESTIMATING THE LENGTH OF THE OPTIMAL TSP TOUR - AN EMPIRICAL-STUDY USING REGRESSION AND NEURAL NETWORKS
    KWON, O
    GOLDEN, B
    WASIL, E
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (10) : 1039 - 1046
  • [4] A distribution-free TSP tour length estimation model for random graphs
    Cavdar, Bahar
    Sokol, Joel
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 243 (02) : 588 - 598
  • [5] TSP optimisation using multi tour ants
    Hendtlass, T
    [J]. INNOVATIONS IN APPLIED ARTIFICIAL INTELLIGENCE, 2004, 3029 : 523 - 532
  • [6] Certification of an optimal TSP tour through 85,900 cities
    Applegate, David L.
    Bixby, Robert E.
    Chvatal, Vasek
    Cook, William
    Espinoza, Daniel G.
    Goycoolea, Marcos
    Helsgaun, Keld
    [J]. OPERATIONS RESEARCH LETTERS, 2009, 37 (01) : 11 - 15
  • [7] ON THE LENGTH OF OPTIMAL TSP CIRCUITS IN SETS OF BOUNDED DIAMETER
    MORAN, S
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (02) : 113 - 141
  • [8] An Improvement to the 2-Opt Heuristic Algorithm for Approximation of Optimal TSP Tour
    Uddin, Fakhar
    Riaz, Naveed
    Manan, Abdul
    Mahmood, Imran
    Song, Oh-Young
    Malik, Arif Jamal
    Abbasi, Aaqif Afzaal
    [J]. APPLIED SCIENCES-BASEL, 2023, 13 (12):
  • [9] Optimal mobile robot pose estimation using geometrical maps
    Borges, GA
    Aldon, MJ
    [J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2002, 18 (01): : 87 - 94
  • [10] Foley-Sammon optimal discriminant vectors using kernel approach
    Zheng, WM
    Zhao, L
    Zou, CR
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 2005, 16 (01): : 1 - 9
12345