The goal of this application is to design an ant system which can be used to solve the Travelling Salesman Problem. This application uses air travel as the metaphor and places a restriction on the distance that a plane can travel from one city to another. This restriction means that some cities may need to be visited more than once. Some cities do not need to be visited, and are optional.

How it works

Ants travel from city to city, leaving a pheromone trail (blue). The shorter the total path, the stronger the pheromone. Ants use the strength of the pheromone as a factor when deciding which path to follow. This favors shorter paths, so they are more likely to be followed, strengthening short tours. The shortest tour of the current generation is shown in yellow.