@article{Astorga_Crawford_Soto_Monfroy_García_Cortes_2018, title={A Meta-Optimization Approach to Solve the Set Covering Problem}, volume={23}, url={https://revistas.udistrital.edu.co/index.php/reving/article/view/13247}, DOI={10.14483/23448393.13247}, abstractNote={<p><strong>Context</strong>: In the industry the resources are increasingly scarce. For this reason, we must make a good<br>use of it. Being the optimization tools, a good alternative that it is necessary to bear in mind. A realworld<br>problem is the facilities location being the Set Covering Problem, one of the most used models.<br>Our interest, it is to find solution alternatives to this problem of the real-world using metaheuristics.</p> <p><strong>Method</strong>: One of the main problems which we turn out to be faced on having used metaheuristic is the<br>difficulty of realizing a correct parametrization with the purpose to find good solutions. This is not an<br>easy task, for which our proposal is to use a metaheuristic that allows to provide good parameters to<br>another metaheuristics that will be responsible for resolving the Set Covering Problem.</p> <p><strong>Results</strong>: To prove our proposal, we use the set of 65 instances of OR-Library which also was compared<br>with other recent algorithms, used to solve the Set Covering Problem.</p> <p><strong>Conclusions</strong>: Our proposal has proved to be very effective able to produce solutions of good quality<br>avoiding also have to invest large amounts of time in the parametrization of the metaheuristic responsible<br>for resolving the problem.</p>}, number={3}, journal={Ingeniería}, author={Astorga, Gino and Crawford, Broderick and Soto, Ricardo and Monfroy, Eric and García, José and Cortes, Enrique}, year={2018}, month={Nov.} }