Table 2 Sequence of paths and cost for each cluster of burma14.
From: Adapting blockchain’s proof-of-work mechanism for multiple traveling salesmen problem optimization
Clusters | Path | Cost |
|---|---|---|
1 | (19.41, 97.13), (20.47, 97.02), (21.52, 95.59), (22., 96.05), (25.23, 97.24), (22.39, 93.37), (20.09, 92.54), (20.09, 94.55), (19.41, 97.13) | 15 |
2 | (19.41, 97.13), (16.47, 94.44), (16.47, 96.1), (17.2, 96.29), (16.3, 97.38), (14.05, 98.12), (16.53, 97.38), (19.41, 97.13) | 11 |
