Week 9: Ant Colony Optimisation Flashcards

1
Q

Ant Colony Optimisation

A

This algorithm takes inspiration from the pathfinding methods of ants. Ants leave pheromones when they traverse a path, which increases the likelihood that subsequent ants will follow this path.

Pros:
- Easy to implement parallel methods
- Feedback procedure accounts for good solutions
- Efficient for TSP-like problems due to inherent structure
- Population-based search (as opposed to Simulated Annealing)

Cons
- Easy to fall into local optima region
- The probability distribution changes over time
- Time of convergence is unknown

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Pheromone Update

A

The updating of pheromones is usually tied to the total cost of the path the ant takes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Evaporation

A

There’s usually a mechanism for evaporating pheromones in each iteration.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Probability of Selecting Edges

A

These are proportional to the pheronome level of the edge multiplied by the inverse of the cost of the edge.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly