bee algorithm

28
HONEY BEE ALGORITHM IN CLOUD COMPUTING S.SRINIVASALOU S.KOUSICK DEPARTMENT OF CSE

Upload: kousick

Post on 27-Jun-2015

801 views

Category:

Technology


4 download

TRANSCRIPT

Page 1: Bee algorithm

HONEY BEE ALGORITHM IN CLOUD COMPUTING

S.SRINIVASALOUS.KOUSICK

DEPARTMENT OF CSE

Page 2: Bee algorithm

Introduction Nature of the bees Hill climbing Swarm based optimization Bee algorithm Proposed bee algorithm Example-bee algorithm Conclusion

Outline

Page 3: Bee algorithm

Proposing a shortest path Provide speed and accuracy Gives optimal solution Swarm based algorithm Avoid bottleneck

Introduction

Page 4: Bee algorithm

To provide a decision making process to overcome the bottleneck

The main goal of bees is to provide a optimal solution for the given set of process

It initiates a waggle dance to communicate What is a waggle dance?

◦It is a dance that performed by scout bees to inform other foraging bees about nectar site.

Nature of bees

Page 5: Bee algorithm

A group of bees provide a nector from different places……..

Nature of bees

Page 6: Bee algorithm

Evalute the total bees from different places….

Nature of bees

Page 7: Bee algorithm

Perform waggle dance -

Nature of bees

Page 8: Bee algorithm

A method to occur on with optimal solution. Provides hill climbing process it includes ---

Ant colony optimization – (to determine shortest path)

Genetic algorithm –(creates a new set of population) Particle swarm optimization – (social behaviour of

groups on org.) Bee algorithm – (occur at optimal solution)

Swarm based optimization

Page 9: Bee algorithm

It is an optimization technique It can be used to solve that has many

number of solutions. Applied to travelling sales person problem

to determine the shortest route with minimal cost.

Widely used in AI , to know the starting and goal state.

HILL CLIMBING

Page 10: Bee algorithm

The algorithm that determine the basic concept of honey bees to occur with the optimal solution.

Bee algorithm

Page 11: Bee algorithm

1. Initialise population with random solutions.2. Evaluate fitness of the population.3. While (stopping criterion not met) //Forming new population.4. Select sites for neighbourhood search.5. Recruit bees for selected sites (more bees for

best e sites) and evaluate fitnesses.6. Select the fittest bee from each patch.7. Assign remaining bees to search randomly

and evaluate their fitnesses.8. End While.

Bee - procedure

Page 12: Bee algorithm

The bee algorithm can be explained as with a simple flow chart…..

Bee-representation

Page 13: Bee algorithm

Masaryk University, Brno, Czech Republic , Wed 08 Apr 2009 13

Evaluate the Fitness of the Population

Determine the Size of Neighbourhood(Patch Size ngh)

Recruit Bees for Selected Sites(more Bees for the Best e Sites)

Select the Fittest Bee from Each Site

Assign the (n–m) Remaining Bees to Random Search

New Population of Scout Bees

Select m Sites for Neighbourhood Search

Neig

hb

ou

rhood

S

earc

h

Flowchart of the Basic BA

Initialise a Population of n Scout Bees

Page 14: Bee algorithm

Step 1 N= no of bees in random manner

(ie) N = 500

Proposed bee algorithm

Page 15: Bee algorithm

Step 2 F = fitness if optimal solution is 500 out of

1000 Then a single bee results with the

50% of its optimal solution Second bee may have 50% or more Process continues until it reaches

the optimal solution

Proposed bee algorithm

Page 16: Bee algorithm

The optimal solution for the 500 bees is represented by.,

Proposed bee algorithm

01 02 03 ………

………

………

500

50% 60% 80% -------

--------

--------

75%

Page 17: Bee algorithm

Once stored recognizes the best among the overall bees

Filtered in ascending order◦ (ie) from higher priority to lower priority.

Proposed bee algorithm

Page 18: Bee algorithm

Consider a graph in a random manner….

Bee - example

Page 19: Bee algorithm

Consider N = 10 in a random graph.

Bee - example

Page 20: Bee algorithm

Bee - example

x

y

*

*

**

** ***

*

Page 21: Bee algorithm

Population evaluation an array of 10 values in constructed

and ordered in ascending way from the highest value of y to the lowest value of y depending on the previous mathematical function

The best m site is chosen randomly ( the best evaluation to m scout bee) from n

m=5, e=2, m-e=3

Bee - example

Page 22: Bee algorithm

x

y

▪▫

* ****

me

Page 23: Bee algorithm

• Assign random neighborhood ngh as follow

Bee - example

Page 24: Bee algorithm

x

y

▪▫

Page 25: Bee algorithm

Select the best bee from each location (higher fitness) to form the new bees population.

At the end we reach the best solution as shown in the following figure

Bee – example

Page 26: Bee algorithm

Bees = servers Flower patches = web applications Advert board = waggle dance Server = forager/scout Advert board = the board which fulfills the

request of the corresponding servers.

Bee algorithm in cloud computing

Page 27: Bee algorithm

Thus an optimal solution is obtained through bee’s algorithm in cloud computing.

Provided with speed and accuracy Better optimal value.

Conclusion

Page 28: Bee algorithm

Thank you