A hybrid heuristic for the set covering problem

In this paper, we present a hybrid approach combining an artificial bee colony (ABC) algorithm with a local search to solve the non-unicost Set Covering Problem (SCP). Given a 0–1 matrix where each column is associated with a non-negative cost. A 1 at the jth column of ith row of this matrix indicates that row i is covered by column j, whereas, a 0 indicates that it is not. The objective of the SCP is to find a subset of columns with minimum cost such that each row of the matrix is covered by at least one column. The ABC algorithm is a recent metaheuristic technique based on the intelligent foraging behavior of honey bee swarm. Computational results show that our ABC algorithm is competitive in terms of solution quality with other metaheuristic approaches for the SCP problem.

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

[2]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[3]  Moshe B. Rosenwein,et al.  An interactive optimization system for bulk-cargo ship scheduling , 1989 .

[4]  Zhi-Gang Ren,et al.  New ideas for applying ant colony optimization to the set covering problem , 2010, Comput. Ind. Eng..

[5]  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).

[6]  Antonio Sassano,et al.  A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..

[7]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .

[8]  Mohamed Haouari,et al.  A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem , 2002, J. Oper. Res. Soc..

[9]  David Avis,et al.  SET COVERING PROBLEMS , 1980 .

[10]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[11]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[12]  Marco Caserta,et al.  Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems , 2007, Metaheuristics.

[13]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[14]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[15]  Dervis Karaboga,et al.  Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems , 2007, IFSA.

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

[17]  M. Yagiura,et al.  RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM , 2007 .

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

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

[20]  M. Yagiura,et al.  RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM( the 50th Anniversary of the Operations Research Society of Japan) , 2007 .

[21]  Alok Singh,et al.  An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem , 2009, Appl. Soft Comput..

[22]  U Aickelin.  An indirect genetic algorithm for set covering problems , 2002, J. Oper. Res. Soc..

[23]  Francis J. Vasko,et al.  A set covering approach to metallurgical grade assignment , 1989 .

[24]  J. Beasley.  An algorithm for set covering problem , 1987 .

[25]  Barbara M. Smith,et al.  Impacs - A bus crew scheduling system using integer programming , 1988, Math. Program..

[26]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[27]  Michel Gendreau,et al.  Metaheuristics: Progress in Complex Systems Optimization , 2007 .

[28]  Toshihide Ibaraki,et al.  Logical analysis of numerical data , 1997, Math. Program..

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

[30]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

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

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

[33]  Michael J. Brusco,et al.  A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems , 1999, Ann. Oper. Res..

[34]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[35]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[36]  Toshihide Ibaraki,et al.  A 3-flip neighborhood local search for the set covering problem , 2006, Eur. J. Oper. Res..

[37]  Dervis Karaboga,et al.  A survey: algorithms simulating bee swarm intelligence , 2009, Artificial Intelligence Review.