Challenge #266: Mother's Day Bouquet

[sara_burk]

Hi @Kurohits, 

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. 

Sara

[OllieClarke]

Fun challenge! I wasn't sure if everything was supposed to be a macro or not...

Spoiler

[balajilolla]

Spoiler

Solution Attached

[patrick_digan]

For fun, I solved it without macros (I used @jdunkerley79 's Alteryx Abacus instead). VarNum and VarText are powerful functions once you learn how to use them.

Spoiler

[TonyA]

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...

Spoiler

, 

[AngelosPachis]

My solution to challenge #266

Output : 

Workflow :

Spoiler

Iterative Macro :

Spoiler

[nlensing001]

My solution

[KaneG]

Interesting results, and shows some of the difficulties with the Travelling Salesman model. Some of those interesting points:

• Changing the route to 6,9,8,7,10 would be quicker.
• By not just taking the closest 30 stores, 7 more stops could have been included between Point 5 and Point 10 with minimal extra travel
• The quickest route would go from Point 15 then 30 > 26, 16 > 25

Spoiler

My Workflow:

My Iterative Macro:

And my map:

[JasonHu]

Spoiler

Here is my solution.

[DataPrepChad_dup_84]

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. 

Spoiler