1 / 17

Stefka Fidanova Institute for Information and Communication Technologies

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

december
Download Presentation

Stefka Fidanova Institute for Information and Communication Technologies

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. Hard Optimization Problems • Vehicle routing problem • Decision making problem • Cutting stock problem • Sensor layout problem • GPS surveying problem • Multidimensional surface global optimum

  3. Metaheuristics • A metaheuristicsare 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

  4. MetaheuristicsMethods • Genetic algorithm • Simulated annealing • Tabu search • Ant colony optimization • Particle swarm optimization

  5. Ant Colony Optimization

  6. Ant Colony Optimization Procedure ACO Begin initialize the pheromone while stopping criterion not satisfied do position each ant on a starting node repeat for each ant do chose next node end for until every ant has build a solution update the pheromone end while end

  7. Level of Parallelism • Problem division to subproblems • Several ant colonies communicates after every iteration • Several ant colonies without communications

  8. Problem Division to Subproblems

  9. Ant Colonies with communications

  10. Ant Colonies without communications

  11. Examples • Sensor layout problem • Global optimum on multidimensional surface

  12. Wireless Sensor Network • Reconnaissance • Surveillance • Forest fire prevention • Volcano eruption study • Health data monitoring • Civil engineering

  13. WSN Layout Problem • High Energy Communication Node • Sensing Radius • Communication Radius • Fully Covered and Connected Area • Minimal Number of Sensors

  14. Sensor Layout Problem • Ant colonies without communications

  15. Global Optimum on Multidimensional Surface

  16. Global Optimum on Multidimensional Surface • Surface decomposition • 4 ant colonies on one processor • Several colonies without communications

  17. Thank for Your Attention

More Related