A statistical approach to the tsp
- 1 September 1977
- Vol. 7 (3) , 209-225
- https://doi.org/10.1002/net.3230070303
Abstract
This paper is an example of the growing interface between statistics and mathematical optimization. A very efficient heuristic algorithm for the well‐known NP‐complete TSP is presented, from which statistical estimates of the optimal tour length can be derived. Assumptions, along with computational experience and conclusions are discussed.Keywords
This publication has 17 references indexed in Scilit:
- Implementing vehicle routing algorithmsNetworks, 1977
- Asymptotic Results for Goodness-of-Fit Statistics with Unknown ParametersThe Annals of Statistics, 1976
- Some Simple Applications of the Travelling Salesman ProblemJournal of the Operational Research Society, 1975
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- A man-machine approach toward solving the traveling salesman problemCommunications of the ACM, 1971
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959
- Limiting forms of the frequency distribution of the largest or smallest member of a sampleMathematical Proceedings of the Cambridge Philosophical Society, 1928