Stefka Fidanova Institute for Information and Communication Technologies

17
Ant Algorithm and its Applications for Solving Large Scale Optimization Problems on Parallel Computers Stefka Fidanova Institute for Information and Communication Technologies Bulgarian Academy of Sciences

description

Ant Algorithm and its Applications for Solving Large Scale Optimization Problems on Parallel Computers. Stefka Fidanova Institute for Information and Communication Technologies Bulgarian Academy of Sciences. Hard Optimization Problems. Vehicle routing problem Decision making problem - PowerPoint PPT Presentation

Transcript of Stefka Fidanova Institute for Information and Communication Technologies

Page 1: Stefka Fidanova Institute for Information and Communication Technologies

Ant Algorithm and its Applications for Solving Large Scale Optimization

Problems on Parallel Computers

Stefka FidanovaInstitute for Information and

Communication TechnologiesBulgarian Academy of Sciences

Page 2: Stefka Fidanova Institute for Information and Communication Technologies

Hard Optimization Problems

• Vehicle routing problem

• Decision making problem

• Cutting stock problem

• Sensor layout problem

• GPS surveying problem

• Multidimensional surface global optimum

Page 3: Stefka Fidanova Institute for Information and Communication Technologies

Metaheuristics

• A metaheuristics are methods for solving a very general class of computational problems by combining user-given black-box procedures in the hope of obtaining a more efficient or more robust procedure. The name combines the Greek prefix "meta" ("beyond", here in the sense of "higher level") and "heuristic" (from ευρισκειν, heuriskein, "to find").

• Metaheuristics are generally applied to problems for which there is no satisfactory problem-specific algorithm or heuristic; or when it is not practical to implement such a method. Most commonly used metaheuristics are targeted to combinatorial optimization problems, but of course can handle any problem that can be recast in that form, such as solving boolean equations

Page 4: Stefka Fidanova Institute for Information and Communication Technologies

Metaheuristics Methods

• Genetic algorithm

• Simulated annealing

• Tabu search

• Ant colony optimization

• Particle swarm optimization

Page 6: Stefka Fidanova Institute for Information and Communication Technologies

Ant Colony OptimizationProcedure ACOBegin

initialize the pheromonewhile stopping criterion not satisfied do

position each ant on a starting noderepeat

for each ant dochose next node

end foruntil every ant has build a solutionupdate the pheromone

end whileend

Page 7: Stefka Fidanova Institute for Information and Communication Technologies

Level of Parallelism

• Problem division to subproblems

• Several ant colonies communicates after every iteration

• Several ant colonies without communications

Page 8: Stefka Fidanova Institute for Information and Communication Technologies

Problem Division to Subproblems

1

2

3

4

Page 9: Stefka Fidanova Institute for Information and Communication Technologies

Ant Colonies with communications

Page 10: Stefka Fidanova Institute for Information and Communication Technologies

Ant Colonies without communications

Page 11: Stefka Fidanova Institute for Information and Communication Technologies

Examples

• Sensor layout problem

• Global optimum on multidimensional surface

Page 13: Stefka Fidanova Institute for Information and Communication Technologies

WSN Layout Problem

• High Energy Communication Node

• Sensing Radius

• Communication Radius

• Fully Covered and Connected Area

• Minimal Number of Sensors

Page 14: Stefka Fidanova Institute for Information and Communication Technologies

Sensor Layout Problem

• Ant colonies without communications

Page 15: Stefka Fidanova Institute for Information and Communication Technologies

Global Optimum on Multidimensional Surface

Page 16: Stefka Fidanova Institute for Information and Communication Technologies

Global Optimum on Multidimensional Surface

• Surface decomposition

• 4 ant colonies on one processor

• Several colonies without communications

Page 17: Stefka Fidanova Institute for Information and Communication Technologies

Thank for Your Attention