Computational Experience with an M-Salesman Traveling Salesman Algorithm

Joseph A. Svestka and Vaughn E. Huckfeldt
Additional contact information
Joseph A. Svestka: The Cleveland Trust Company, Cleveland, Ohio
Vaughn E. Huckfeldt: Western Interstate Commission on Higher Education (WICHE), Boulder, Colorado

Management Science, 1973, vol. 19, issue 7, 790-799

Abstract: A formulation of the traveling salesman problem with more than one salesman is offered. The particular formulation has computational advantages over other formulations. Experience is obtained with an exact branch and bound algorithm employing both upper and lower bounds (mean run time for 55 city problems is one minute). Due to the special formulation, certain subtours may satisfy the constraints, thus reducing the search. A very good initial tour and upper bound are employed. The determination of these as well as the pathology of the formulation and the algorithm are discussed. No increase in computation time over the one-salesman case is experienced.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.7.790 (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:19:y:1973:i:7:p:790-799

Access Statistics for this article

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