Python / Earlier experiment
Route Efficiency.
An earlier Python experiment exploring route construction and improvement with nearest-neighbor methods and simulated annealing.
Build a route.
Try another ordering.
Nearest-neighbor methods build a route by choosing nearby points. Simulated annealing explores changes to the ordering, allowing a different search through possible routes.
The interface draws the route as a line between stops, with clear start and finish markers. Seeing the path helps make an abstract ordering problem easier to follow.
It explores a familiar question: how can a route visit a set of places with less backtracking? Trying different orderings is a simple way to see how a small decision can reshape the whole journey.
Another earlier experiment, this time bringing text assessment into a desktop interface.
Related: Sentiment Analysis