Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Christofides, N., Eilon, S. Algorithms for Large-scale Travelling Salesman Problems. J Oper Res Soc 23, 511–518 (1972). https://doi.org/10.1057/jors.1972.79
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1972.79