An Engineering Approach to the Traveling Salesman Problem

S. M. Roberts and Benito Flores
Additional contact information
S. M. Roberts: IBM Federal Systems Division, Houston
Benito Flores: University of Houston

Management Science, 1966, vol. 13, issue 3, 269-288

Abstract: An engineering approach to the traveling salesman problem is a method which is intuitively "reasonable" to the non-mathematician. It consists of a sequence of operations which (1) develops good starting circuits, (2) improves these circuits, (3) extracts sufficient information from the improved circuits to determine pairs or chains of cities likely to appear in the conjectured global minimum cost circuit, (4) with certain cities paired off, develops the graph of the network. The graph program generates all the circuits from the smallest to the largest cost. The method has been applied successfully to the 20, 48, and 57 city traveling salesman problems.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.13.3.269 (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:ormnsc:v:13:y:1966:i:3:p:269-288

Access Statistics for this article

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