0
$\begingroup$

I'm currently trying to figure out an algorithm to calculate a preferably equally long distance for a set of people meeting at each other.

A -> A = 0
A -> B = 3
A -> C = 12
A -> D = 4

B -> A = 3
B -> B = 0
B -> C = 5
B -> D = 8

C -> A = 12
C -> B = 5
C -> C = 0
C -> D = 7

D -> A = 4
D -> B = 8
D -> C = 7
D -> D = 0

Different to the "original" TSP algorithm, it shall be allowed to meet at each of the points multiple times. The algorithm should be limited by a total number of visits.

Example:

Limit: 8

A -> B -> D -> C -> A -> B -> A -> D

Total cost:
A = 26
B = 30
C = 60
D = 35

Unfortunately, I have absolutely no clue how to start.

$\endgroup$

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.