A 2-level Metaheuristic for the Set Covering Problem

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]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[2]  Mauro Brunato,et al.  Reactive Search and Intelligent Optimization , 2008 .

[3]  Broderick Crawford,et al.  Integrating Lookahead and Post Processing Procedures with ACO for Solving Set Partitioning and Covering Problems , 2006, ICAISC.

[4]  Broderick Crawford,et al.  A Evolutionary Approach to Solve Set Covering , 2007, ICEIS.

[5]  Dumitru Dumitrescu,et al.  The Importance of Parameters in Ant Systems , 2006 .

[6]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[7]  S. G. Ponnambalam,et al.  Evolutionary Search Techniques to Solve Set Covering Problems , 2008 .

[8]  Carlos Cotta,et al.  Adaptive and multilevel metaheuristics , 2008 .

[9]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[10]  Thomas Stützle,et al.  A Comparison Between ACO Algorithms for the Set Covering Problem , 2004, ANTS Workshop.

[11]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[12]  J. Beasley,et al.  Enhancing an algorithm for set covering problems , 1992 .

[13]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[14]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[15]  Frédéric Saubion,et al.  What Is Autonomous Search , 2011 .

[16]  Uwe Aickelin,et al.  A genetic algorithm approach for set covering problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.