A Method for Solving Traveling-Salesman Problems

G. A. Croes
Additional contact information
G. A. Croes: Exploration and Production Research Division, Shell Development Company, Houston, Texas

Operations Research, 1958, vol. 6, issue 6, 791-812

Abstract: The traveling-salesman problem is a generalized form of the simple problem to find the smallest closed loop that connects a number of points in a plane. Efforts in the past to find an efficient method for solving it have met with only partial success. The present paper describes a method of solution that has the following properties ( a ) It is applicable to both symmetric and asymmetric problems with random elements ( b ) It does not use subjective decisions, so that it can be completely mechanized ( c ) It is appreciably faster than any other method proposed ( d ) It can be terminated at any point where the solution obtained so far is deemed sufficiently accurate.

Date: 1958
References: Add references at CitEc
Citations: View citations in EconPapers (102)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.6.6.791 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:6:y:1958:i:6:p:791-812

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().