Forum Discussion
How to combine the largest subtours together
Hi, I worked on an assignment where i need to make a tour to visit various retail shops. Where the distance needs to be minimized. I obtained a solution with various sub-tours. I found out how to el...
Thank you very much! This is really helpful!
Then I just have 1 more question because now it gives me the following output (see below). And if i understand the code correctly it selects a tour (in the first case 1,4,3,9) and breaks this tour but I would like it to be combined with the second largest tour. So in the first case that it combines the longest tour(1,4,3,9) and the second longest tour (0,18) Is there any way this can still be implemented in the code?
Total distance: 20.8
0 - 18 - 0
1 - 4 - 3 - 9 - 1
20 - 22 - 20
Selected tour:{1,4,3,9}
Total distance: 20.9
0 - 9 - 0
1 - 3 - 4 - 1
18 - 22 - 20 - 18
Selected tour:{1,3,4}
Total distance: 20.9
0 - 9 - 3 - 4 - 1 - 0
18 - 22 - 20 - 18
Selected tour:{0,9,3,4,1}
Total distance: 21.2
0 - 18 - 9 - 3 - 1 - 4 - 0
20 - 22 - 20
Selected tour:{0,18,9,3,1,4}
Total distance: 21.5
0 - 18 - 22 - 20 - 9 - 3 - 4 - 1 - 0