An Integrated Method Based on PSO and EDA for the Max-Cut Problem

Algorithm 4

Local search procedure.

Require: An initial solution .

Ensure: An improved solution .

()    , .

()    while    do

()     Let , and .

()     Calculate gains , according to (8).

()     for    do

()      Let .

()      Move vertex from its current belonged subset to the other subset . Let .

()      Let , and update the gains of the affected vertices.

()      if    then

()    Let , .

()   end if

()   Let .

()   Move vertex from its current belonged subset to the other subset . Let .

()   Let , and update the gains of the affected vertices.

()   if    then

()    Let , .

()   end if

()  end for

() end while

() return   .