Open AccessTechnical Note—A Note on the Multiple Traveling Salesmen Problem
Author(s) -
M. R. Rao
Publication year - 1980
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.28.3.628
Subject(s) - travelling salesman problem , mathematical optimization , traveling purchaser problem , base (topology) , bottleneck traveling salesman problem , mathematics , 2 opt , computer science , combinatorics , mathematical analysis
The fixed charge symmetric multiple traveling salesmen problem with n cities and m salesmen is transformed to a standard symmetric traveling salesman problem with n + m − 1 cities. The asymmetric problem with m = 2 and a different base city for each salesman is also transformed to a standard asymmetric traveling salesman problem.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom