Setp 2: Search for new food sources and update the place of food sources by employed bees. Apply the k-means algorithm and a greedy selection to evaluate new fitness values and compare them with the original ones. Better food sources will be delivered to onlooker bees. Step 3: Calculate probability values of food sources and update their place according to the probability values by onlooker bees. Again, the k-means algorithm and a greedy selection will be applied to finish clustering, evaluate new fitness values using (6) and compare them with the original ones to update them. Step 4: Check the trial counter of food sources and produce a new food source (set of centroids) in the search space for which exceed the “limit” parameter amount. Step 5: Repeat from step 2 until the termination criterion is met.