D. S. Johnson. 8th DIMACS implementation challenge. http://www.research.att.com/ dsj/chtsp/, web. D. S. Johnson and L. A. McGeoch. Experimental analysis of heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 369--443. Kluwer Academic, Norwell, MA, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Table 1 summarizes the quality of the tours constructed by the three heuristics, where M is the number of nodes in the tour. The numbers indicate by which factor the constructed tour is longer than the optimal tour in the worst case and in the average case according to extensive empirical studies [12]. In TMOS we use NN, since it allows a rather simple implementation of ring setup. This is due to the greedy property of NN that nodes are only appended to a sub tour, i.e. a once constructed subtour is never changed. However, the energy efficiency of TMOS could be increased by about 10 on ....

D. S. Johnson and L. A. McGeoch. Experimental Analysis of Heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 369--443. Kluwer Academic Publishers, 2002.

....random seeds) giving a total 16 4 2 = 128 graphs. 2.2.2 Results In assessing the experimentation, one important issue that arises is how to normalise the results, firstly in order to average them and secondly to compare between different density classes. Initially, and as is common (e.g. [16]) we tried using the percentage excess over the optimal (or best known) solution, which for a solution x with cost f(x) C x is calculated as Q(C x ) 100 , where C min is the cost of the optimal solution. This works well for averaging but not so well for comparisons between the density ....

....be specified as a complete graph with weighted edges, i.e. there is an edge between every pair of cities and the weight of the edge specifies the distance between them. 3. 1 A multilevel algorithm for the travelling salesman problem Recently the multilevel paradigm has been applied to the TSP, [16, 32, 33]. Although the scheme is perhaps less intuitive than multilevel partitioning, clearly the LK algorithm or one of its variants should make a good refinement method. However, with no graph as such, how can the problem be coarsened In fact from [32] it seems that the crucial point in devising a ....

[Article contains additional citation context not shown here]

D. S. Johnson and L. A. McGeoch. Experimental Analysis of Heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Travelling Salesman Problem and its Variations. (To appear ).

....results although it suffers from runtimes which are quadratic, in fact O(N 2:2 ) for problems of size N . In a further recent development, a general solution strategy known as multilevel refinement has been applied with considerable success to the TSP and in particular the CLK algorithm, [7, 13]. The multilevel approach involves recursive coarsening to create a hierarchy of approximations to the original problem; an initial solution is found for the coarsest problem and then iteratively refined at each level, coarsest to finest, 14] When applied to the TSP it was able to significantly ....

....of exchanges, some of which may individually increase the tour length, but which combine to form a shorter tour. A vast amount has been written about the LK algorithm, including much on its efficient implementation, and for an excellent overview of techniques see the surveys of Johnson McGeoch, [6, 7]. Recently a new and highly effective variant of the LK algorithm has been developed by Helsgaun, 4] This scheme employs a number of important innovations including sequential 5 opt moves and the use of sensitivity analysis to direct the search. It has been shown to compute solutions extremely ....

[Article contains additional citation context not shown here]

D. S. Johnson and L. A. McGeoch. Experimental Analysis of Heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Travelling Salesman Problem and its Variations. Kluwer Academic Publishers, 2001. (To appear).

....1 summarizes the quality of the tours constructed by the three heuristics, where indicates the number of nodes in the tour. The numbers indicate by which factor the constructed tour is longer than the optimal tour in the worst case and in the average case according to extensive empirical studies [12]. While NN looks attractive due The node that has the smallest distance to any node in the current heuristic average case worst case NN 1.23 6 2 : 2 NI 1.27 2) FI 1.13 A ;CB)D : Table 1: TSP heuristics performance ( E number of nodes in the tour) to its simplicity, it ....

D. S. Johnson and L. A. McGeoch. Experimental Analysis of Heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations (to appear). Kluwer Academic Publishers, 2002.

No context found.

Johnson, D. S., L. A. McGeoch. 2002. Experimental analysis of heuristics for the STSP. G. Gutin, A. Punnen, eds. The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Dordrecht, The Netherlands. 369-443.

No context found.

D. S. Johnson. 8th DIMACS implementation challenge. http://www.research.att.com/ dsj/chtsp/, web. D. S. Johnson and L. A. McGeoch. Experimental analysis of heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 369--443. Kluwer Academic, Norwell, MA, 2002.

No context found.

D. S. Johnson and L. A. McGeoch. Experimental Analysis of Heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 369--443. Kluwer Academic Publishers, 2002.

No context found.

D. S. Johnson and L. A. McGeoch. Experimental Analysis of Heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Travelling Salesman Problem and its Variations. Kluwer Academic Publishers, 2001. (To appear).

No context found.

D. S. Johnson and L. A. McGeoch. Experimental analysis of heuristics for the STSP. In G. Gutin and A. P. Punnen, editors, The Traveling Salesman Problem and Its Variations, chapter 9, pages 369-487. Kluwer Academic Publishers, 2002.

No context found.

D. S. Johnson and L. A. McGeoch. Experimental Analysis of Heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Travelling Salesman Problem and its Variations. (To appear ).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC