An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem

The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the quality of the results provided by these approaches highly depends on customized operators that demands high effort from researchers and practitioners. In order to alleviate the complexity of designing metaheuristics, a methodology called hyper-heuristic has emerged as a possible solution. A hyper-heuristic is capable of dynamically selecting simple low-level heuristics accordingly to their performance, alleviating the design complexity of the problem solver and obtaining satisfactory results at the same time. In a previous study, we proposed a hyper-heuristic approach based on Ant Colony Optimization (ACO-HH) for solving the SCP. This paper extends our previous efforts, presenting better results and a deeper analysis of ACO-HH parameters and behavior, specially about the selection of low-level heuristics. The paper also presents a comparison with an ACO meta-heuristic customized for the SCP.

[1]  Márk Jelasity,et al.  Distributed hyper-heuristics for real parameter optimization , 2009, GECCO.

[2]  L. W. Jacobs,et al.  Note: A local-search heuristic for large set-covering problems , 1995 .

[3]  Hong Chang,et al.  A fast and efficient ant colony optimization approach for the set covering problem , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[4]  David Meignan,et al.  Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism , 2010, J. Heuristics.

[6]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[7]  Sanja Petrovic,et al.  HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search , 2011, EvoCOP.

[8]  J. Berman.  What is a Classification , 2012 .

[9]  Graham Kendall,et al.  An Ant Based Hyper-heuristic for the Travelling Tournament Problem , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[10]  Graham Kendall,et al.  An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

[12]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[13]  Guanghui Lan,et al.  An effective and simple heuristic for the set covering problem , 2007, Eur. J. Oper. Res..

[14]  Alexander Nareyek,et al.  Choosing search heuristics by non-stationary reinforcement learning , 2004 .

[15]  Mauro Henrique Mulati,et al.  Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem , 2011, 2011 30th International Conference of the Chilean Computer Science Society.

[16]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[17]  Andries Petrus Engelbrecht,et al.  Investigating the use of local search for improving meta-hyper-heuristic performance , 2012, 2012 IEEE Congress on Evolutionary Computation.

[18]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

[19]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[20]  Saïd Salhi,et al.  Hyper-heuristic approaches for the response time variability problem , 2011, Eur. J. Oper. Res..

[21]  Jasper A Vrugt,et al.  Improved evolutionary optimization from genetically adaptive multimethod search , 2007, Proceedings of the National Academy of Sciences.

[22]  J. Deneubourg,et al.  The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.

[23]  He Jiang,et al.  Ant Based Hyper Heuristics with Space Reduction: A Case Study of the p-Median Problem , 2010, PPSN.

[24]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[25]  Graham Kendall,et al.  Guided Operators for a Hyper-Heuristic Genetic Algorithm , 2003, Australian Conference on Artificial Intelligence.

[26]  Edmund K. Burke,et al.  An ant algorithm hyperheuristic for the project presentation scheduling problem , 2005, 2005 IEEE Congress on Evolutionary Computation.