Two groups with equal number of nodes. Nodes in the second group can only be visited after their corresponding nodes in the first group are visited.
I want to know whether there are some alogirthms to solve this kind of TSP.
Thanks a lot!
Two groups with equal number of nodes. Nodes in the second group can only be visited after their corresponding nodes in the first group are visited.
I want to know whether there are some alogirthms to solve this kind of TSP.
Thanks a lot!
Please provide: