ant colony algorithm l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Ant colony algorithm PowerPoint Presentation
Download Presentation
Ant colony algorithm

Loading in 2 Seconds...

play fullscreen
1 / 11

Ant colony algorithm - PowerPoint PPT Presentation


  • 334 Views
  • Uploaded on

Ant colony algorithm. Ant colony algorithm mimics the behavior of insect colonies completing their activities. Ant colony looking for food < == > Solving a problem N Individual ants < == > N Solutions

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Ant colony algorithm' - adamdaniel


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
ant colony algorithm
Ant colony algorithm
  • Ant colony algorithmmimics the behavior of insect colonies completing their activities

Ant colony looking for food < == > Solving a problem

N Individual ants < == > N Solutions

Each time the colony goes to < == > Population of N solutions

look for food and returns to

the nest

ant colony algorithm2
Ant colony algorithm
  • Ant colony algorithmmimics the behavior of insect colonies completing their activities
  • Collective process:

Some kind of invisible agent (having a global memory of the process) is coordinating and having an impact on the behavior of each individual

The solutions of the current population (associated with the individual insects) are used to update this global memory (trace of pheromone)

Ant colony looking for food < == > Solving a problem

N Individual ants < == > N Solutions

Each time the colony goes to < == > Population of N solutions

look for food and returns to

the nest

ant colony algorithm3
Ant colony algorithm
  • Ant colony algorithm mimics the behavior of insect colonies completing their activities
  • Individual process:

A new feasible solution (corresponding to an ant going out to look for food) is generated by means of a constructive method (the ant moving forward) that uses the information in the global memory of the invisible agent

Ant colony looking for food < == > Solving a problem

N Individual ants < == > N Solutions

Each time the colony goes to < == > Population of N solutions

look for food and returns to

the nest

ant colony algorithm4
Ant colony algorithm
  • Ant colony algorithm well suited for assignment-type problem
ant colony algorithm5
Ant colony algorithm
  • Ant colony algorithm well suited for assignment-type problem
  • Contructing a new solution (corresponding to an ant):
ant colony algorithm6
Ant colony algorithm
  • Ant colony algorithm well suited for assignment-type problem
  • Contructing a new solution (corresponding to an ant):

- In traditional construction procedure (Greedy, GRASP, for instance), at each iteration we select an activity and a resource to assigned to it, according to the best desirability of the pair ( for instance, to optimize the objective function given the values of the variables already fixed)

ant colony algorithm7
Ant colony algorithm
  • Ant colony algorithm well suited for assignment-type problem
  • Contructing a new solution (corresponding to an ant):

- In traditional construction procedure (Greedy, GRASP, for instance), at each iteration we select an activity and a resource to assigned to it according to the best desirability of the pair ( for instance, to optimize the objective function given the values of the variables already fixed)

- In ant colony algorithm, at each iteration the selection of the pair activity & resource is made according to the desirability of the pair and also according to past history included in the global memory

graph coloring problem greedy vs ant colony
Graph coloring problem:

Vertices are ordered in

decreasing order of their degree

Vertices selected in that order

For each vertex, select a color in order to reduce the number of pairs of adjacent vertices already colored with the same color

Graph coloring problem:

Vertices are ordered in

decreasing order of their degree

Vertices selected in that order

For each vertex, select a color in order to reduce the number of pairs of adjacent vertices already colored with the same color

and accounting for the quality of solutions where the vertex has the color.

Impact of a given solution decreases with the number of iterations since it was generated

Graph coloring problemGreedy vs Ant Colony