A Clustering Approach Using Cooperative Artificial Bee Colony Algorithm

Algorithm 2

Pseudocode for CABC algorithm.

Main steps of the CABC algorithm

(2.1)cycle=1

(2.2)Initialize the food source positions 𝑥_𝑖,𝑖=1⋅𝑆𝑁

(2.3)Evaluate the nectar amount(fitnessfit_𝑖) of food sources and find the best food source which is

 the initial value of gbest

(4)  repeat

(5) For each component 𝑗∈(1,2,…,𝐷)

(6)   Employed Bees’ Phase

    For each employed bee 𝑖=1⋯𝑆𝑁

      Replace the𝑗component of the gbest by using the𝑗component of bee 𝑖

      Calculate the 𝑓[newgbest (𝑔₁,𝑔₂,…,𝑥_𝑖𝑗,…,𝑔_𝐷)]

      If 𝑓(newgbest) better than 𝑓(gbest)

      Then gbest is replaced by newgbest

      For employed bee 𝑖 produce new food source positions 𝑣𝑖 by using  (2.1)

      Calculate the value fit_𝑖

      Apply greedy selection mechanism

    EndFor.

(7)   Calulate the probability values 𝑝_𝑖 for the solution.

(8)   Onlooker Bees’ Phase

    For each onlooker bee 𝑖=1⋯𝑆𝑁

      Chooses a food source depending on 𝑝_𝑖

      Replace the 𝑗 component of the gbest by using the 𝑗 component of bee 𝑖

      Calculate the 𝑓[newgbest (𝑔₁,𝑔₂,…,𝑥_𝑖𝑗,…,𝑔_𝐷)]

      If 𝑓 (newgbest) better than 𝑓(gbest)

      Then gbest is replaced by newgbest

      For onlooker bee 𝑖 produce new food source positions 𝑣𝑖 by using  (2.1)

      Calculate the value fit_𝑖

      Apply greedy selection mechanism

    EndFor

  EndFor

(9) Scout Bees’ Phase

    If there is an employed bee becomes scout

    Then replace it with a new random source positions

(10) Memorize the best solution achieved so far

(11) Compare the best solution with gbest and Memorize the better one.

(12) cycle=cycle+1.

(13)  until cycle=Maximum Cycle Number