A heuristic for the traveling salesman problem based on a continuous approximation

A procedure for solving, suboptimally, the traveling salesman problem is presented. The set of points on the traveling salesman tour is distributed over a region having the shape of a circular or ring sector. The procedure is based on an optimal partition of the sector and reduces the tour construction to a sorting problem. Namely, the tour is constructed by visiting the points in radial or angular order depending on the part of the sector on which they are located. The optimal partition is derived by a continuous approximation of the set of points. It is defined by a single parameter and simple analytical expressions for it are obtained. A great number of numerical tests were carried out to evaluate the performance of the procedure. These tests allowed a measure of the difference from the optimum solution that could be obtained for problems up to a few hundred points. The results show that the euclidean length of the tours produced by the partition procedure grows, on average, like √(AN), where A is the region area and N the number of points. The initial tours are improved by means of the Or's algorithm and the final tours obtained are nearly as good as those given by more intricate improvement heuristics. The whole procedure, that is, the tour construction and improvement heuristics, is rather simple to implement on a computer, which makes it very appealing to use in routing software.