Research Article
An Integrated Method Based on PSO and EDA for the Max-Cut Problem
Algorithm 5
Path relinking procedure.
Require: An initiating solution and the current best solution . | Ensure: . | () Calculate the distance according to (10). | () if then | () Let . | () end if | () Calculate gains , according to (8). | () The difference set is determined according to (9). | () while do | () Let , . | () if then | () Let . Return . | () else | () Let (Assume that ). | () Set , , and update the gains of affected vertices. | () if then | () Let | () Set , , and update the gains of affected vertices. | () end if | () end if | () end while | () return . |
|