Académique Documents
Professionnel Documents
Culture Documents
Goal
NP-hard problem
QAP Example
Locations Facilities biggest flow: A - B
Higher cost
Lower cost
Colony of cooperating individuals Pheromone trail for stigmergic communication Sequence of moves to find shortest paths Stochastic decision using local information
Strategies
Choosing a Facility
Choosing a Location Pheromone Update
heuristic
P(pheromone , heuristic) (solution quality)
Test problems
tai12a
Type of problem Size random 12
tai50a
random 50
kra30a
Real-life 30
Results: tai12a
Without local search convergence to local minimum
NOT ALWAYS the optimum Heuristic gets better minimun With local search: always converges to optimum Very quickly
With LS
Optimum Avg.12 iterations Optimum Avg.10 iterations
With heuristic
Future Work
Different strategies
Choosing a Facility Choosing a Location Pheromone Update
Remain fixed, all ants use the same! Performance of strategies varies
Problem
Co-evolution
Conclusions
The ants did find their way to the Beach Pool Beer
Ants Path
Locations Facilities biggest flow: A - B
Path
(1,A) |
Path
(1,C) |
(2,B)
| (3,C) Higher cost Lower cost
(2,B)
| (3,A)