stefka fidanova institute for information and communication technologies
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 PresentationTRANSCRIPT
![Page 1: Stefka Fidanova Institute for Information and Communication Technologies](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/1.jpg)
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](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/2.jpg)
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](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/3.jpg)
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](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/4.jpg)
Metaheuristics Methods
• Genetic algorithm
• Simulated annealing
• Tabu search
• Ant colony optimization
• Particle swarm optimization
![Page 6: Stefka Fidanova Institute for Information and Communication Technologies](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/6.jpg)
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](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/7.jpg)
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](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/8.jpg)
Problem Division to Subproblems
1
2
3
4
![Page 9: Stefka Fidanova Institute for Information and Communication Technologies](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/9.jpg)
Ant Colonies with communications
![Page 10: Stefka Fidanova Institute for Information and Communication Technologies](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/10.jpg)
Ant Colonies without communications
![Page 11: Stefka Fidanova Institute for Information and Communication Technologies](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/11.jpg)
Examples
• Sensor layout problem
• Global optimum on multidimensional surface
![Page 12: Stefka Fidanova Institute for Information and Communication Technologies](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/12.jpg)
Wireless Sensor Network
• Reconnaissance
• Surveillance
• Forest fire prevention
• Volcano eruption study
• Health data monitoring
• Civil engineering
![Page 13: Stefka Fidanova Institute for Information and Communication Technologies](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/13.jpg)
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](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/14.jpg)
Sensor Layout Problem
• Ant colonies without communications
![Page 15: Stefka Fidanova Institute for Information and Communication Technologies](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/15.jpg)
Global Optimum on Multidimensional Surface
![Page 16: Stefka Fidanova Institute for Information and Communication Technologies](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/16.jpg)
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](https://reader036.vdocument.in/reader036/viewer/2022062309/56813cce550346895da67659/html5/thumbnails/17.jpg)
Thank for Your Attention