A 2-level Metaheuristic for the Set Covering Problem
AbstractMetaheuristics 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.
 U. Aickelin, An Indirect Genetic Algorithm for Set Covering Problems, Journal of the Operational esearch Society, Vol.53, pp.1118-1126, 2002
 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
 C-M. Pintea, D. Dumitrescu, The importance of parameters in Ant Systems, INT J COMPUT OMMUN, ISSN 1841-9836, 1(S):376-380, 2006
 R. Martí, M. Laguna, Scatter Search: Dise-o Básico y Estrategias, Revista Iberoamericana e Inteligencia, Vol.19, pp.123-130, 2003
 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
 A. Caprara, M. Fischetti, P. Toth, Algorithms for the Set Covering Problem, Annals of perations Research, Vol.98, 1998
 J. E. Beasley, K. Jornsten, Enhancing an algorithm for set covering problems, European ournal of Operational Research, Vol.58, pp.293-300, 1992
 C. Cotta, M. Sevaux, K. Sörensen, Adaptive and Multilevel Metaheuristics, Springer, 2008
 Z. Michalewicz, Genetic algorithms + data structures = evolution programs, Springer, 1996.
 F. Glover, G. A. Kochenberger, Handbook of metaheuristics, Springer, 2003
 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
 Y. Hamadi, E. Monfroy, F. Saubion, What is Autonomous Search?, Technical Report MSRTR- 008-80, 2008
 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
 E. Talbi, Metaheuristics: From Design to Implementation, Wiley Publishing, 2009
 R. Battiti, M. Brunato, F. Mascia, Reactive Search and Intelligent Optimization, Springer erlag, 2008
 J. E. Beasley, OR Library, http://people.brunel.ac.uk/mastjjb/jeb/info.html
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.