返回
Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization
DOI:10.1111/itor.13260.png)
摘要
En 中文
Approximation of the optimal tour length in a Euclidean traveling salesman problem (TSP) has been studied by many researchers. In a previous study, we used the standard deviation in random tour lengths to approximate the optimal tour length in both Euclidean and non-Euclidean TSPs and we obtained good estimates. In this paper, we show that the strong power-law relationship between the standard deviation in random feasible solution values and the optimal solution value also holds for other Euclidean and near-Euclidean combinatorial optimization problems like the minimum spanning tree (MST) and maximum weight matching (MWM) problems. We then enhance the estimation ability of the model by considering a second predictor: the mean in random feasible solution values. Experimental results show that by using the mean, standard deviation, and randomization, we can accurately predict the optimal solution values for the TSP, MST, MWM, and the capacitated vehicle routing problem (VRP).
Keyword:
combinatorial optimization
traveling salesman problem
vehicle routing problem
regression
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
Vitamin D Up-Regulates the Vitamin D Receptor by Protecting It from Proteasomal Degradation维生素D通过保护维生素D受体免受蛋白酶体降解而上调其表达。
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
The Relevance of Secondary Epileptogenesis to the Treatment of Epilepsy: Kindling and the Mirror Focus
Epilepsia
IF0

