Efficient Parallel Sorting for Migrating Birds Optimization When Solving Machine-Part Cell Formation Problems

Algorithm 1

Pseudocode of Migrating Birds Optimization.

()   Generate initial solutions in V-formation

()   

()   while do

()   for ; ; ++ do

()    Improve the leading solution by generating and evaluating neighbors of it

()    

()    for each solution in the flock (except leader) do

()     Try to improve by evaluating neighbors of it and unused best

        neighbors from the leader

()      

()     end

()   end

()   Move the leader solution to the end and forward one of the solutions following it

      to the leader position

() end

() Return the best solution in the flock