论文信息 - Algorithms for Large-scale Travelling Salesman Problems

Algorithms for Large-scale Travelling Salesman Problems

The paper describes a new algorithm to produce r-optimal tours for the travelling salesman problem. This algorithm is faster than the original r-optimal method, and computation times increase much less rapidly with problem size. The new algorithm makes it possible to solve large-scale travelling salesman problems and examples are given for problems varying in size from 100 to 500 cities. The paper also discusses r-optimality in terms of multistage 2-optimality.

Nicos Christofides | Samuel Eilon | Nicos Christofides | S. Eilon

[1] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[2] Nicos Christofides,et al. An Algorithm for the Vehicle-dispatching Problem , 1969 .

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