Research Article
Exploring Further Advantages in an Alternative Formulation for the Set Covering Problem
Algorithm 3
Heuristic operator for solution feasibility in ABC.
| initialize | | initialize | | for each row in increasing order of do | | find the first column in minimizing equation (23)-default or (24)-proposal | | add to | | set , and | | end for | | for each column in decreasing order of do | | ifthen | | set and | | end if | | end for | | return , which is a feasible SCP solution, without redundant columns |
|