An Engineering Approach to the Traveling Salesman Problem
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.
Volume (Year): 13 (1966)
Issue (Month): 3 (November)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:13:y:1966:i:3:p:269-288. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.