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

Algorithm 3

EDA procedure.

Require: A population , a probability vector .

Ensure: A new population .

()    The best solutions in are identified.

()    Use (6) and (7) to obtain the probability vector .

()    for     do

()     Generate at random.

()     for    do

()      Generate at random.

()      if    then

()       Let .

()      else

()    Let .

()   end if

()  end for

()  .

()  A path relinking procedure is executed to intensify the search.

()  Update and .

() end for

() .

() return  .