A Beam-Search Approach to the Set Covering Problem

In this work we present a beam-search approach applied to the Set Covering Problem. The goal of this problem is to choose a subset of columns of minimal cost covering every row. Beam Search constructs a search tree by using a breadth-first search strategy, however only a fixed number of nodes are kept and the rest are discarded. Even though original beam search has a deterministic nature, our proposal has some elements that makes it stochastic. This approach has been tested with a well-known set of 45 SCP benchmark instances from OR-Library showing promising results.

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

[2]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

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

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

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

[6]  Peter Norvig,et al.  Chapter 24 – ANSI Common Lisp , 1992 .

[7]  Carsten Peterson,et al.  An efficient mean field approach to the set covering problem , 1999, Eur. J. Oper. Res..

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

[9]  Mauricio Solar,et al.  A parallel genetic algorithm to solve the set-covering problem , 2002, Comput. Oper. Res..

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

[11]  Andrew Lim,et al.  A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..

[12]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[13]  Xiang Song,et al.  A beam search implementation for the irregular shape packing problem , 2010, J. Heuristics.

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

[15]  E. Balas.  A class of location, distribution and scheduling problems : modeling and solution methods , 1982 .

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

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

[18]  Kap Hwan Kim,et al.  A beam search algorithm for the load sequencing of outbound containers in port container terminals , 2004 .

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