OPERATIONAL ESTIMATORS FOR THE LENGTH OF A TRAVELING SALESMAN TOUR

被引:44
|
作者
CHIEN, TW
机构
[1] Baruch College, The City University of New York, New York
关键词
D O I
10.1016/0305-0548(92)90002-M
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We define several estimators that can be used to obtain approximations for the length of a traveling salesman tour based on the actual locations of customers and the depot. We perform extensive Monte Carlo experiments to determine the "best" multiplier values that should be used with the estimators, and compute average approximation errors of the estimators. Sensitivity analysis that examines the robustness of the estimators with different shapes of the service region is also conducted. The results show that very accurate and robust tour length approximations can be obtained using one of the proposed estimators.
引用
收藏
页码:469 / 478
页数:10
相关论文
共 50 条
  • [1] Estimating the Tour Length for the Close Enough Traveling Salesman Problem
    Sinha Roy, Debdatta
    Golden, Bruce
    Wang, Xingyin
    Wasil, Edward
    [J]. ALGORITHMS, 2021, 14 (04)
  • [2] Simple cubic graphs with no short traveling salesman tour
    Lukot'ka, Robert
    Mazak, Jan
    [J]. DISCRETE APPLIED MATHEMATICS, 2018, 244 : 218 - 222
  • [3] An effective tour construction and improvement procedure for the traveling salesman problem
    Zweig, G
    [J]. OPERATIONS RESEARCH, 1995, 43 (06) : 1049 - 1057
  • [4] Modeling Quartiles and Variance of Optimal Traveling Salesman Tour Lengths
    Yang, Hongtai
    Liang, Xiuqin
    Zhang, Zhaolin
    Zhang, Xu
    Abid, Malik Muneeb
    Liu, Yugang
    [J]. 2019 5TH INTERNATIONAL CONFERENCE ON TRANSPORTATION INFORMATION AND SAFETY (ICTIS 2019), 2019, : 897 - 902
  • [6] COMBINATORIAL ALGORITHM FOR M-TOUR TRAVELING SALESMAN PROBLEMS
    MARTINEC, I
    [J]. EKONOMICKO-MATEMATICKY OBZOR, 1979, 15 (03): : 320 - 341
  • [7] On estimating the distribution of optimal traveling salesman tour lengths using heuristics
    Vig, Vikrant
    Palekar, Udatta S.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 186 (01) : 111 - 119
  • [8] Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows
    Kara, Imdat
    Derya, Tusan
    [J]. 4TH WORLD CONFERENCE ON BUSINESS, ECONOMICS AND MANAGEMENT (WCBEM-2015), 2015, 26 : 1026 - 1034
  • [9] FINDING THE OPTIMAL A PRIORI TOUR AND LOCATION OF A TRAVELING SALESMAN WITH NONHOMOGENEOUS CUSTOMERS
    BERMAN, O
    SIMCHILEVI, D
    [J]. TRANSPORTATION SCIENCE, 1988, 22 (02) : 148 - 154
  • [10] Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour
    Gutin, G
    Yeo, A
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (04) : 321 - 327