Scribd
Upload
144 views13 pages

Ant Colony Optimization for QAP

Ant colony optimization is used to solve the quadratic assignment problem of assigning n facilities to n locations to minimize costs. Real ants lay pheromone trails to communicate shortest paths, and ant colony optimization mimics this by having artificial ants probabilistically choose facility-location assignments based on pheromone levels and problem heuristics. Tests on random and real-life problems showed the algorithm converges quickly to optimal solutions when combined with local search, and performs better when using problem heuristics to guide the search. Future work could explore different ant strategies and their performance.

Uploaded by

javed765
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
144 views13 pages

Ant Colony Optimization for QAP

Ant colony optimization is used to solve the quadratic assignment problem of assigning n facilities to n locations to minimize costs. Real ants lay pheromone trails to communicate shortest paths, and ant colony optimization mimics this by having artificial ants probabilistically choose facility-location assignments based on pheromone levels and problem heuristics. Tests on random and real-life problems showed the algorithm converges quickly to optimal solutions when combined with local search, and performs better when using problem heuristics to guide the search. Future work could explore different ant strategies and their performance.

Uploaded by

javed765
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd

Ant Colony Optimization

Quadratic Assignment Problem


Hernan AGUIRRE, Adel BEN HAJ YEDDER, Andre DIAS and Pascalis RAPTIS

Problem Leader: Marco Dorigo Team Leader: Marc Schoenauer

Quadratic Assignment Problem


Assign n facilities to n locations
Distances between locations Flows between facilities
known

Goal

Minimize sum flow x distance

TSP is a particular case of QAP


Models many real world problems

NP-hard problem

QAP Example
Locations Facilities biggest flow: A - B

How to assign facilities to locations ?

Higher cost

Lower cost

Ant Colony Optimization (ACO)


Ant Algorithms
Inspired by observation of real ants

Ant Colony Optimization (ACO)


Inspiration from ant colonies foraging behavior (actions of the colony finding food)

Colony of cooperating individuals Pheromone trail for stigmergic communication Sequence of moves to find shortest paths Stochastic decision using local information

Ant Colony Optimization for QAP


Pheromone laying Basic ACO algorithm Local Search 1st best improvement facilities-location assignment

Ant Colony Optimization for QAP


Basic ACO algorithm Actions

Strategies

Choosing a Facility
Choosing a Location Pheromone Update

heuristic
P(pheromone , heuristic) (solution quality)

Ant Colony Optimization for QAP

How important search guidance is?

Test problems
tai12a
Type of problem Size random 12

tai50a
random 50

kra30a
Real-life 30

12 facilities/positions should be easy to solve!

What behavior with real life problems?


QAP solved to optimality up to 30
Parameters for ACO: 500 ants, evaporation =0.9

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

Results: Real Life - Kra30a


No LS
No Heuristic Converges local minimum 72 % optimum Converges local minimum 70% optimum

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

Stage of the search

Co-evolution

Let the ants find it!

Conclusions

Great Summer School!

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)

You might also like