Your browser will no longer run
simulation models on RunTheModel.com

Travelling Salesman Problem - Ant Colony

The objective of the TSP (Travelling Salesman Problem) is to make a tour through all nodes with the lowest cost (in this case, distance).

The model is based on the way ants behave when looking for food. Ants are generated in different points, and choose their route according to the distance to the next node and the amount of pheromone between nodes. At the end of the route, ants leave a pheromone concentration on each link that they went through. The fastest ants leave more pheromone.

Update: you can drag the nodes around.

The model was created with AnyLogic - simulation software / Route Optimization