I have the following problem:
1 Start point 1 End point 7 Knots / waypoints which you have to visit in any order
All 9 knots are connected with each other. All paths have to start at the start point and end at the end point. All paths have to visit all 7 points in any order exactly once.
Now I need to find x individual paths which are the shortest connections and also the closest to each other in terms of length. (e.g. the shortest path would be 10 but is not chosen because 3 paths are 22, 21, 20 long).
Another restriction is, that each path can only visit knots/wayponints where no other path is at the moment. So every knot has a capability of 1 for the same step e.g. if I am looking for 5 paths which are shortest and closest together in terms of length, at the second step after the start point, just one path of the five can be at know number 1, etc.
How can I solve this problem? Best in Excel, Python or R