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 for your answer! I attached my files now.
I found the examples that you are pointing out to me and used these. But I don't know how to adapt the smallest to the largest. So what I basically would like the program to do is to go from the subsets:
0-18-0
20-22-20
1-4-3-9-1
to combine the 2 largest subsets and optimize this to
0-18-9-1-4-3-0
20-22-20
and lastly to find the last optimum
0-18-22-20-9-1-4-3-0
Hope you can help me out on this.
Thank you very much in advance!
Heleen Brans