A 2-level Metaheuristic for the Set Covering Problem

  • Claudio Valenzuela Pontificia Universidad Católica de Valparaíso Valparaíso, Chile
  • Broderick Crawford Pontificia Universidad Católica de Valparaíso Valparaíso, Chile
  • Ricardo Soto 1. Pontificia Universidad Católica de Valparaíso Valparaíso, Chile, and 2. Universidad Autónoma de Chile
  • Eric Monfroy Universidad Técnica Federico Santa María Valparaíso, Chile
  • Fernando Paredes Escuela de Ingeniería Industrial Universidad Diego Portales Santiago, Chile


Metaheuristics are solution methods which combine local improvement procedures and higher level strategies for solving combinatorial and nonlinear optimization problems. In general, metaheuristics require an important amount of effort focused on parameter setting to improve its performance. In this work a 2-level metaheuristic approach is proposed so that Scatter Search and Ant Colony Optimization act as “low level" metaheuristics, whose parameters are set by a “higher level" Genetic Algorithm during execution, seeking to improve the performance and to reduce the maintenance. The Set Covering Problem is taken as reference since is one of the most important optimization problems, serving as basis for facility location problems, airline crew scheduling, nurse scheduling, and resource allocation.


[1] B. Crawford, C. Lagos, C. Castro, F. Paredes, A Evolutionary Approach to Solve Set Covering, CEIS 2007 - Proceedings of the Ninth International Conference on Enterprise Information ystems, Volume AIDSS, Funchal, Madeira, Portugal, June 12-16, 2007 (2), pp.356-363, 007

[2] U. Aickelin, An Indirect Genetic Algorithm for Set Covering Problems, Journal of the Operational esearch Society, Vol.53, pp.1118-1126, 2002

[3] F. Tangour, P. Borne, Presentation of Some Metaheuristics for the Optimization of Complex ystems, Studies in Informatics and Control, Vol.17, No.2, pp.169-180, 2008

[4] C-M. Pintea, D. Dumitrescu, The importance of parameters in Ant Systems, INT J COMPUT OMMUN, ISSN 1841-9836, 1(S):376-380, 2006

[5] R. Martí, M. Laguna, Scatter Search: Dise-o Básico y Estrategias, Revista Iberoamericana e Inteligencia, Vol.19, pp.123-130, 2003

[6] D. Gouwanda, S. G. Ponnambalam, Evolutionary Search Techniques to Solve Set Covering roblems, World Academy of Science, Engineering and Technology, Vol.39, pp.20-25, 2008

[7] A. Caprara, M. Fischetti, P. Toth, Algorithms for the Set Covering Problem, Annals of perations Research, Vol.98, 1998

[8] J. E. Beasley, K. Jornsten, Enhancing an algorithm for set covering problems, European ournal of Operational Research, Vol.58, pp.293-300, 1992

[9] C. Cotta, M. Sevaux, K. Sörensen, Adaptive and Multilevel Metaheuristics, Springer, 2008

[10] Z. Michalewicz, Genetic algorithms + data structures = evolution programs, Springer, 1996.

[11] F. Glover, G. A. Kochenberger, Handbook of metaheuristics, Springer, 2003

[12] B. Crawford, C. Castro, Integrating Lookahead and Post Processing Procedures with ACO or Solving Set Partitioning and Covering Problems, Proceedings of ICAISC, pp.1082-1090, 006

[13] Y. Hamadi, E. Monfroy, F. Saubion, What is Autonomous Search?, Technical Report MSRTR- 008-80, 2008

[14] L. Lessing, I. Dumitrescu, T. Stützle, A Comparison Between ACO Algorithms for the Set overing Problem, it Proceedings of ANTS, pp.1-12, 2004

[15] E. Talbi, Metaheuristics: From Design to Implementation, Wiley Publishing, 2009

[16] R. Battiti, M. Brunato, F. Mascia, Reactive Search and Intelligent Optimization, Springer erlag, 2008

[17] J. E. Beasley, OR Library, http://people.brunel.ac.uk/mastjjb/jeb/info.html
How to Cite
VALENZUELA, Claudio et al. A 2-level Metaheuristic for the Set Covering Problem. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, [S.l.], v. 7, n. 2, p. 377-387, sep. 2014. ISSN 1841-9844. Available at: <http://univagora.ro/jour/index.php/ijccc/article/view/1417>. Date accessed: 07 mar. 2021. doi: https://doi.org/10.15837/ijccc.2012.2.1417.


metaheuristics, genetic algorithm, scatter search, ant colony optimization, set covering problem.