Surrogate constraint normalization for the set covering problem

The set covering problem (SCP) is central in a wide variety of practical applications for which finding good feasible solutions quickly (often in real-time) is crucial. Surrogate constraint normalization is a classical technique used to derive appropriate weights for surrogate constraint relaxations in mathematical programming. This framework remains the core of the most effective constructive heuristics for the solution of the SCP chiefly represented by the widely-used Chvatal method. This paper introduces a number of normalization rules and demonstrates their superiority to the classical Chvatal rule, especially when solving large scale and real-world instances. Directions for new advances on the creation of more elaborate normalization rules for surrogate heuristics are also provided.

[1]  Francis J. Vasko,et al.  An efficient heuristic for large set covering problems , 1984 .

[2]  Federico Malucelli,et al.  Parallel randomized heuristics for the set covering problem , 2001 .

[3]  Fred W. Glover,et al.  Tutorial on Surrogate Constraint Approaches for Optimization in Graphs , 2003, J. Heuristics.

[4]  G. Kochenberger,et al.  Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems , 1988 .

[5]  Edward K. Baker,et al.  Efficient heuristic algorithms for the weighted set covering problem , 1981, Comput. Oper. Res..

[6]  Francis J. Vasko,et al.  Using a facility location algorithm to solve large set covering problems , 1984 .

[7]  M. Hifi,et al.  A neural network for the minimum set covering problem , 2000 .

[8]  Fred Glover,et al.  Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..

[9]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

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

[11]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[12]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[13]  Fred W. Glover,et al.  Surrogate constraint analysis-new heuristics and learning schemes for satisfiability problems , 1996, Satisfiability Problem: Theory and Applications.

[14]  Jesús T. Pastor,et al.  An adaptation of SH heuristic to the location set covering problem , 1997, Eur. J. Oper. Res..

[15]  Vangelis Th. Paschos,et al.  A New Efficient Heuristic for the Minimum Set Covering Problem , 1995 .

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

[17]  Francis J. Vasko,et al.  Solving large set covering problems on a personal computer , 1988, Comput. Oper. Res..

[18]  L A N Lorena,et al.  Genetic algorithms applied to computationally difficult set covering problems , 1997 .

[19]  Davis Avis.  A note on some computationally difficult set covering problems , 1980, Math. Program..

[20]  Salim Haddadi,et al.  Simple Lagrangian heuristic for the set covering problem , 1997 .

[21]  Éric D. Taillard,et al.  Few statistical tests for proportions comparison , 2008, Eur. J. Oper. Res..

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

[23]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[24]  Douglas A. Wolfe,et al.  Nonparametric Statistical Methods , 1973 .

[25]  Alexander H. G. Rinnooy Kan,et al.  The Design, Analysis and Implementation of Heuristics , 1988 .

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

[27]  Elena Marchiori,et al.  An Iterated Heuristic Algorithm for the Set Covering Problem , 1998, WAE.

[28]  Martin Dyer.  Calculating surrogate constraints , 1980, Math. Program..

[29]  L. A. Lorena,et al.  A surrogate heuristic for set covering problems , 1994 .

[30]  Hasan Pirkul,et al.  Surrogate Constraints in Integer Programming , 1991 .

[31]  César Rego,et al.  RAMP: A New Metaheuristic Framework for Combinatorial Optimization , 2005 .

[32]  Torbjörn Larsson,et al.  A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem , 1994, Discret. Appl. Math..

[33]  Elena Marchiori,et al.  An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling , 2000, EvoWorkshops.

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

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

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

[37]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[38]  Bahram Alidaee,et al.  Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (Operations Research/Computer Science Interfaces Series) , 2005 .

[39]  Fred W. Glover,et al.  Surrogate Constraints , 1968, Oper. Res..

[40]  Bruno Simeone,et al.  Clustering heuristics for set covering , 1993, Ann. Oper. Res..

[41]  Harvey J. Greenberg,et al.  Surrogate Mathematical Programming , 1970, Oper. Res..

[42]  T. Grossman,et al.  Computational Experience with Approximation Algorithms for the Set Covering Problem , 1994 .