Research Article
Optimizing Virtual Private Network Design Using a New Heuristic Optimization Method
Algorithm 1
Landscape smoothing search (LSS).
Procedure algorithm LSS (F,λ,X,G) | begin | create initial feasible solution | set (X)= 0, (h = 1,…,H) | (set all initial smoothing factors to zero) | for i: = 1 to max-iterations | begin | (X) = F(X) + | = Local search (, , , G) | for each h: = 1 to H | begin | adjust (X); | ( is the local optimum point) | if F() < then | : = F(); | : = ; | end | adjust for adaptive λ; | end | end procedure | LSS returns where F() is the minimum of all solutions so far. |
|