返回
Optimal TSP tour length estimation using standard deviation as a predictor
DOI:10.1016/j.cor.2022.105993.png)
摘要
En 中文
For a given set of traveling salesman problem (TSP) instances, the optimal tour lengths of these instances can be predicted reasonably well using the standard deviation of random tour lengths. This surprising result was first demonstrated in a paper by Basel and Willemain (2001). In our paper, we first update and extend these earlier authors' computational experiments. Next, we seek to answer the question: Why does such a simple predictor work? In response, we reveal the relationship between the standard deviation predictor and root the well-known predictor for Euclidean instances. We also empirically show that the standard deviation predictor is valid for both Euclidean and non-Euclidean instances by applying it to the TSPLIB, randomly generated instances, and real-world instances.
Keyword:
Traveling salesman problem
Estimator
Prediction
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Vitamin D Up-Regulates the Vitamin D Receptor by Protecting It from Proteasomal Degradation维生素D通过保护维生素D受体免受蛋白酶体降解而上调其表达。
OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networksOSMnx: 获取、构建、分析和可视化复杂街道网络的新方法
Injury-Dependent and Disability-Specific Lumbar Spinal Gene Regulation following Sciatic Nerve Injury in the Rat大鼠坐骨神经损伤后损伤依赖性和残疾特异性腰椎基因调控
PLOS ONE
IF0
SciPy 1.0: fundamental algorithms for scientific computing in PythonSciPy 1.0: Python中科学计算的基本算法
NATURE METHODS
IF32.1

