There are some great videos on the iterative macro within the Alteryx community. The solution will be posted next Monday - happy to explain further after the solution is posted if there are any questions.
Enjoyed doing this challenge, but now it's gotten me rethinking the old travelling salesman problem. This algorithm is obviously not the way to do it. Just looking at the resulting path, was able to eyeball a route that cut about 8 miles off the travel distance. Hopefully, some day I'll find some time to play with this some more...
Interesting results, and shows some of the difficulties with the Travelling Salesman model. Some of those interesting points:
My Iterative Macro:
And my map:
So if you are familiar with iterative macros, that is actually the easier part of this challenge! Getting the report to match exactly what the expected solution is took a bit more time for me.