Ant_Colony_Algorithm.pptVIP

Ant colony algorithm Ant colony algorithm mimics the behavior of insect colonies completing their activities Ant colony algorithm Ant colony algorithm mimics 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 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 algorithm Ant colony algorithm well suited for assignment-type problem Ant colony algorithm Ant colony algorithm well suited for assignment-type problem Contructing a new solution (corresponding to an ant): 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 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