Experiments with LAGRASP heuristic for set k-covering

The set k-covering problem (SCkP) is a variant of the classical set covering problem, in which each object is required to be covered at least k times. We describe a hybrid Lagrangean heuristic, named LAGRASP, which combines subgradient optimization and GRASP with path-relinking to solve the SCkP. Computational experiments carried out on 135 test instances show experimentally that by properly tuning the parameters of LAGRASP, it is possible to obtain a good trade-off between solution quality and running times. Furthermore, LAGRASP makes better use of the dual information provided by subgradient optimization and is able to discover better solutions and to escape from locally optimal solutions even after the stabilization of the lower bounds, whereas other strategies fail to find new improving solutions.

[1]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[2]  Mauricio G. C. Resende,et al.  AN OPTIMIZER IN THE TELECOMMUNICATIONS INDUSTRY , 2007 .

[3]  Egon Balas,et al.  On the set covering polytope: I. All the facets with coefficients in {0, 1, 2} , 1986, Math. Program..

[4]  Russell Schwartz,et al.  Haplotypes and informative SNP selection algorithms: don't block out information , 2003, RECOMB '03.

[5]  Anand Subramanian,et al.  Exact and heuristic approaches for the set cover with pairs problem , 2012, Optim. Lett..

[6]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[7]  N. S. Barnett,et al.  Private communication , 1969 .

[8]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[9]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

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

[11]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[12]  Dorit S. Hochbaum,et al.  The multicovering problem , 1992 .

[13]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[14]  Egon Balas,et al.  On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2} , 1989, Math. Program..

[15]  M. Resende,et al.  Greedy Randomized Adaptive Search Procedures. , 2003 .

[16]  Celso C. Ribeiro,et al.  A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering , 2013, Comput. Oper. Res..

[17]  Mauricio G. C. Resende,et al.  A biased random-key genetic algorithm for the Steiner triple covering problem , 2012, Optim. Lett..

[18]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[19]  Yu Gu,et al.  Disjoint-Path Facility Location: Theory and Practice , 2011, ALENEX.

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

[21]  Pasquale Avella,et al.  Computational experience with general cutting planes for the Set Covering problem , 2009, Oper. Res. Lett..

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

[23]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..