Computing the variance of tour costs over the solution space of the TSP in polynomial time

Authors:
Paul J. Sutcliffe;Andrew Solomon;Jenny Edwards
Affiliations:
Faculty of Engineering and Information Technology, University of Technology, Sydney, Sydney, Australia;Faculty of Engineering and Information Technology, University of Technology, Sydney, Sydney, Australia;Faculty of Engineering and Information Technology, University of Technology, Sydney, Sydney, Australia
Venue:
Computational Optimization and Applications
Year:
2012

Citing 9
Cited 0

Probability (2nd ed.)

Probability (2nd ed.)
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number

Discrete Applied Mathematics
Random Tours in the Traveling Salesman Problem: Analysis and Application

Computational Optimization and Applications
Optimization by Vector Space Methods

Optimization by Vector Space Methods
On Random Symmetric Travelling Salesman Problems

Mathematics of Operations Research
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The traveling salesman: computational solutions for TSP applications

The traveling salesman: computational solutions for TSP applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an O(n 2) time algorithm to find the population variance of tour costs over the solution space of the n city symmetric Traveling Salesman Problem (TSP). The algorithm has application in both the stochastic case, where the problem is specified in terms of edge costs which are pairwise independently distributed random variables with known mean and variance, and the numeric edge cost case.We apply this result to provide empirical evidence that, in a range of real world problem sets, the optimal tour cost correlates with a simple function of the mean and variance of tour costs.