0
$\begingroup$

Here is an interesting variation to the classic TSP.

Consider the 20-city TSP. Let city 11 be the home base of a company with an eight-person sales force. Each of the the cities must be visited exactly once (except for the home base). How should the cities be divided up? What routes should sales people take? Assume that each sales person must visit at least two other cities other than the home base on his route.

I have found an optimal solution to this problem by taking note that city 11 must have degree 16 (all the rest having degree exactly 2), and going forward with sub-tour eliminations until a solution is reached.

Now I am trying to modify the problem in order to find the best home base possible. What changes would I need to make in order to minimize the total distance traveled and ensure that one of the cities has degree 16 while the rest have degree 2? Any thoughts or comments would be appreciated!

$\endgroup$
  • $\begingroup$ Perhaps there is something useful in Rathinam, Sivakumar and Sengupta, Raja, Lower and upper bounds for a symmetric multiple depot, multiple travelling salesman problem, available at escholarship.org/uc/item/4z68041r#main $\endgroup$ – Gerry Myerson Nov 1 '17 at 1:56
  • $\begingroup$ Have you had a look at that reference? $\endgroup$ – Gerry Myerson Nov 3 '17 at 0:58
  • $\begingroup$ Are you still here? $\endgroup$ – Gerry Myerson Nov 4 '17 at 5:52
  • $\begingroup$ I'm voting to close this question as off-topic because OP has abandoned it. $\endgroup$ – Gerry Myerson Nov 6 '17 at 12:10

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.