Ant Colony Optimization Demo

This is a visual demo which uses the Ant Colony Optimization alrogithm to solve the classic traveling salesman problem. GitHub

Start by placing at least 2 "cities" by clicking inside the canvas below.
Tweak parameter settings as desired (or leave them alone for a reasonable default).
Click Start and see the visualization of how the algorithm determines the shortest path that travels through all of the "cities".

The yellow dots represent the "cities", in which the "ants" will be traveling between.
The blue lines represent all of the possible paths between the cities. Their Thickness represent the "pheromone" on that particular path.
The moving black dots represent the "ants" crawing along the paths.
The green line represent the current best(shortest) route that travels through all of the "cities" as determined by the algorithm.

Parameters:

Colony size: Alpha: Beta: Rho: Pheromone deposit weight: Initial pheromone: Max iterations: Type: Elitest weight: Minimum scaling factor:

Info:

Iteration:

Best distance: