This piece is inspired by the work of Robert Bosch.
We take the Travis Logo, and select some points. Then we solve a Traveling Salesman Problem taking those points as cities and the Euclidean distance in the 2D space. We finally draw the solution to obtain a nice drawing.
To solve the TSP we use a Hill Climbing implementation with variable neighborhood starting from a random solution. We let Travis set the pace for the solution. Whenever we receive an event from the server, then we execute the next iteration of the algorithm. The implementation includes three neighborhood operators:
Here is a speedrun for the impacients:
Big thanks to @alyfdezarias, my wife, for her help with the neighborhoods.To the team page Go to repo See demo