Greetings,
I have this workflow which uses a nearest neighbor macro (greedy algorithm) to do a local optimization approximating the traveling salesman problem. It simply iterates through each remaining location until every location is visited (because of the sheer number of permutations it is impossible to do a global optimization) and determines the shortest path visiting every location. I want to approximate the global optimization by reiterating the macro with each location serving as the starting point. Then I want it to select the route with the shortest total distance and output that. I believe this means I will need an iterative macro within an iterative macro. I am simply not familiar enough with how to program this in Alteryx, and I would be very appreciative for any assistance that you can offer.
Thank you very much,
Daniel