On the worst-case performance of some algorithms for the asymmetric traveling salesman problem

We consider the asymmetric traveling salesman problem for which the triangular inequality is satisfied. For various heuristics we construct examples to show that the worst-case ratio of length of tour found to minimum length tour is (n) for n city problems. We also provide a new O([log2n]) heuristic.

[1]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[2]  M. H. J. Webb,et al.  Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of Cities , 1971 .

[3]  Laurence A. Wolsey,et al.  An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit , 1979, Oper. Res..

[4]  B. Korte,et al.  Worst case analysis of greedy type algorithms for independence systems , 1980 .

[5]  B. Korte,et al.  An Analysis of the Greedy Heuristic for Independence Systems , 1978 .

[6]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[7]  Kenneth Steiglitz,et al.  Some Examples of Difficult Traveling Salesman Problems , 1978, Oper. Res..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  G. L. Nemhauser,et al.  Tight bounds for christofides' traveling salesman heuristic , 1978, Math. Program..

[10]  Bruce L. Golden,et al.  Evaluating a Sequential Vehicle Routing Algorithm , 1977 .

[11]  D. J. Rosenkrantz,et al.  Approximate Algorithms for the Traveling Salesperson Problem , 1974, SWAT.

[12]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[13]  T. A. J. Nicholson,et al.  A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems , 1967 .

[14]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[15]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[16]  Alan Frieze,et al.  An extension of Christofides heuristic to the k-person travelling salesman problem , 1983, Discret. Appl. Math..

[17]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[18]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[19]  M. J. Rijckaert,et al.  Heuristic for the Asymmetric Travelling Salesman Problem , 1978 .