A Meta-Optimization Approach to Solve the Set Covering Problem

<jats:p>Context: In the industry the resources are increasingly scarce. For this reason, we must make a gooduse of it. Being the optimization tools, a good alternative that it is necessary to bear in mind. A realworldproblem is the facilities location being the Set Covering Problem, one of the most used models.Our interest, it is to find solution alternatives to this problem of the real-world using metaheuristics.
Method: One of the main problems which we turn out to be faced on having used metaheuristic is thedifficulty of realizing a correct parametrization with the purpose to find good solutions. This is not aneasy task, for which our proposal is to use a metaheuristic that allows to provide good parameters toanother metaheuristics that will be responsible for resolving the Set Covering Problem.
Results: To prove our proposal, we use the set of 65 instances of OR-Library which also was comparedwith other recent algorithms, used to solve the Set Covering Problem.
Conclusions: Our proposal has proved to be very effective able to produce solutions of good qualityavoiding also have to invest large amounts of time in the parametrization of the metaheuristic responsiblefor resolving the problem.</jats:p>