Computational Experience with an M-Salesman Traveling Salesman Algorithm
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.
Year of publication: |
1973
|
---|---|
Authors: | Svestka, Joseph A. ; Huckfeldt, Vaughn E. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 19.1973, 7, p. 790-799
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Computational experience with an M-salesman traveling salesman algorithm
Svestka, Joseph A., (1973)
-
Computation experience with an M-salesman traveling salesman algorithm
Svestka, Joseph A., (1973)
-
Change in higher education management
Huckfeldt, Vaughn E., (1974)
- More ...