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

Algorithm 1

General structure of PSO-EDA.

Require: A graph .

Ensure: A solution .

()    Set , is generated randomly.

()    for  each   do

()     .

()    end for

()    Let , and .

()    Initialize the probability vector .

()    while    do

()     if   can be divided by 2  then

()      PSO procedure is executed to generate a new population .

()  else

()   EDA procedure is performed to generate a new population .

()  end if

()  Let .

()  if   is not improved after continuous generations  then

()   for  each    do

()    .

()    .

()   end for

()  end if

()  Let .

() end while

() return