[Retracted] Differential Evolution Algorithm with Diversified Vicinity Operator for Optimal Routing and Clustering of Energy Efficient Wireless Sensor Networks

Algorithm 1

    Input maximum number of neighborhoods , number of local searches in each neighborhood .

    Loop

 Set , pick random point , and perform a local search to find a local minimum .

    While do

 Consider a neighborhood of such that   .

    for to do

     Sample a random point from ().

     Perform a local search from , to find a local minimum .

      If is better than , set , exit the FOR loop.

   End for

   Set  .

   Verify termination condition; if true, exit.

  end while

   end loop