There are a few interactive maps that induce to solve the perennial Traveling Salesman Problem (TSP). This is the challenge to notice the shortest route possible given a reveal of predefined stops. Among the almost interesting solutions has been the Forio Route Optimizer, which finds the quickest route (with a reveal of stops), land too factoring inwards real-time traffic weather on the roads.
I too similar this novel TSP map which iterates through solutions alive on a map. Which agency you lot tin spotter every bit meliorate in addition to meliorate solutions evolve over time. The Ann Arbor Yum Planner allows you lot to solve the Traveling Salesman Problem for a reveal of Ann Arbor businesses. You tin select from the city's restaurants, cafes, bars, takeouts, deliveries or bakeries to evolve a quick route which takes inwards all of the businesses or whatsoever combination of the trouble concern categories.
The map starts alongside a route in addition to and hence mutates the route. From these off-spring routes it selects the 4 best routes. It in addition to hence repeats this iteration hundreds of times until settling on an acceptable route.
