A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization Problem

Algorithm 1

A cooperative coevolutionary cuckoo search algorithm (minimum).

Begin

  Initializing population 𝑝₀ with 𝑛₀ organizations, and each organization has one member;

    𝑡←0;

  While (the termination criteria are not reached) do

  Begin

    For each organization in 𝑝_𝑡, if the number of it more than 20, performing the splitting

    operator on it, deleting it from 𝑝_𝑡, and adding the child organizations into 𝑝_𝑡+1;

    While (the number of organizations in is 𝑝_𝑡 greater than 1) do

    Begin

      Randomly selecting two parent organizations 𝑜𝑟𝑔_𝑝1 and 𝑜𝑟𝑔_𝑝2 from 𝑝_𝑡;

      Performing the CS and selecting their leaders;

      If rand < 0.5

        Annexing operator;

      Else

        Cooperating operator;

        If 𝑓(𝑤)<𝑓(𝑥) and 𝑓(𝑧)<𝑓(𝑦)

          𝑥=𝑤;

          𝑦=𝑧;

        End

        adding the child organizations into 𝑝_𝑡+1;

      End

      Deleting 𝑜𝑟𝑔_𝑝1and 𝑜𝑟𝑔_𝑝2form 𝑝_𝑡;

    End

    Deleting the 𝑢 organizations form 𝑝_𝑡+1;

    % 𝑢 is the child number of join organizations

    𝑝_𝑡←𝑝_(𝑡+1);

    𝑡←𝑡+1;

  End

  output the best solution in 𝑝_𝑡

End