traveling salesman

80 posts
Traveling salesman image drawing

This is a fun drawing experiment in R by Antonio Sánchez Chinchón. A simple process: convert an image to black and white, sample the black points, and then solve the Traveling Salesman Problem for those points. Draw the resulting path for something like the above. Grab the R code to try it with your own images and settings. Tags: R, traveling salesman

0 0
Algorithms for the Traveling Salesman Problem visualized

The Traveling Salesman Problem is a popular puzzle that asks for the shortest route between a set of points such that you visit each point once and end up back where you started. The problem is trivial for a few points, but it gets tricky as you add more. Here are are a few of the strategies in action. x See also this interactive simulation. Or, you can try using...

0 0