Research Article
Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs
Algorithm 4
Evaluation of a new population in the E-FA.
| for to do | | for to do | | if ( is better than based on Deb’s rules) then | | for to (dimension of the problem) do | | | end for | | if ( is better than based on Deb’s rules) then | | | end if | | end if | | end for | | end for |
|
