ANTS & SWARM OPTIMIZATION

No ant carries a map, and no ant compares the two routes. Each simply drips pheromone onto the path it has just walked and leans toward whichever scent is stronger, while the scent evaporates. The shorter route is completed more times in the same interval, so it accumulates scent faster, and positive feedback does the rest. Fast evaporation makes the colony forget and re-explore; slow evaporation converges firmly but risks clinging to whatever route was found first, and that exact mechanism became the ACO algorithm of Marco Dorigo in the early 1990s.

▸ Releasing the ant colony from nest to food…
▸ Laying pheromone on the path, scent evaporates gradually
▸ The short route accrues scent faster → more attractive
▸ Stigmergy: converging with no leader (ACO)…
▸ Online. ✅
0%
⌂ Complex systems

Simulation room Ants & swarm optimization

Ant Colony Optimization
Online
🐜 stigmergy
Now showing
🐜 State
Short-route scent—
Long-route scent—
Short-route share—
Scenario—
Swarm intelligence
—
Watch the scent on the SHORT route grow stronger → the colony converges · drag Evaporation to shift the explore/exploit balance
Pheromone on the two routes (short vs long)shortlong
About Ant Colony Optimization

No ant carries a map, and no ant compares the two routes. Each simply drips pheromone onto the path it has just walked and leans toward whichever scent is stronger, while the scent evaporates. The shorter route is completed more times in the same interval, so it accumulates scent faster, and positive feedback does the rest. Fast evaporation makes the colony forget and re-explore; slow evaporation converges firmly but risks clinging to whatever route was found first, and that exact mechanism became the ACO algorithm of Marco Dorigo in the early 1990s.

Related topics in Complexity & Chaos