We've recently made an accessibility improvement to the community and therefore posts without any content are no longer allowed. Please use the spoiler feature or add a short message in the message body in order to submit your weekly challenge.

Weekly Challenge

Solve the challenge, share your solution and summit the ranks of our Community!

Also available in | Français | Português | Español | 日本語
IDEAS WANTED

We're actively looking for ideas on how to improve Weekly Challenges and would love to hear what you think!

Submit Feedback

Challenge #266: Mother's Day Bouquet

sara_burk
7 - Meteor

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
13 - Pulsar
13 - Pulsar

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

Spoiler
Challenge 266.PNGChallenge 266 Macro.PNG
balajilolla
8 - Asteroid
Spoiler
Solution Attached

balajilolla_0-1620353997811.png

 

patrick_digan
16 - Nebula
16 - Nebula

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
patrick_digan_0-1620408702902.png

 

 

 

TonyA
Alteryx
Alteryx

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
TonyA_0-1620426795599.pngTonyA_1-1620426843635.png

 

AngelosPachis
15 - Aurora

My solution to challenge #266

 

Output : 

 

AngelosPachis_1-1620574094190.png

 

 

Workflow :

 

 

Spoiler
image.png

Iterative Macro :

Spoiler
AngelosPachis_0-1620574068451.png

 

 

nlensing001
7 - Meteor

My solution

KaneG
Alteryx
Alteryx

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:
KaneG_0-1620618115496.png

My Iterative Macro:

KaneG_1-1620618140138.png

 

And my map:
KaneG_2-1620618168596.png

 

JasonHu
8 - Asteroid
Spoiler
workflow.pngmacro.png

Here is my solution.

DataPrepChad
5 - Atom

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
2021-05-10_6-54-19.jpg