我目前正在尝试找出一种算法,以计算一组彼此见面的人的最佳距离。
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
与“原始” TSP算法不同,应允许它在每个点上多次满足。该算法应受访问总数的限制。
示例:
Limit: 8
A -> B -> D -> C -> A -> B -> A -> D
Total cost:
A = 26
B = 30
C = 60
D = 35
不幸的是,我完全不知道如何开始。