Note: A local-search heuristic for large set-covering problems

In this note we describe a local-search heuristic (LSH) for large non-unicost set-covering problems (SCPs). The new heuristic is based on the simulated annealing algorithm and uses an improvement routine designed to provide low-cost solutions within a reasonable amount of CPU time. The solution costs associated with the LSH compared very favorably to the best previously published solution costs for 20 large SCPs taken from the literature. In particular, the LSH yielded new benchmark solutions for 17 of the 20 test problems. We also report that, for SCPs where column cost is correlated with column coverage, the new heuristic provides solution costs competitive with previously published results for comparable problems. © 1995 John Wiley & Sons, Inc.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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

[3]  Nicos Christofides,et al.  Note—A Computational Survey of Methods for the Set Covering Problem , 1975 .

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

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

[6]  E. Balas.  Cutting planes from conditional bounds: A new approach to set covering , 1980 .

[7]  Mark S. Daskin,et al.  A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment , 1981 .

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

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

[11]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[12]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

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

[14]  Gerald G. Brown,et al.  Scheduling ocean transportation of crude oil , 1987 .

[15]  Francis J. Vasko,et al.  Optimal Selection of Ingot Sizes Via Set Covering , 1987, Oper. Res..

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

[17]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[18]  R. H. J. M. Otten,et al.  The Annealing Algorithm , 1989 .

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

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

[21]  R. Kuik,et al.  Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic , 1990 .

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

[23]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

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

[25]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[26]  Ronald G. Askin,et al.  A note on the effect of neighborhood structure in simulated annealing , 1991, Comput. Oper. Res..

[27]  Wen-Chyuan Chiang,et al.  Simulated annealing for machine layout problems in the presence of zoning constraints , 1992 .

[28]  J. Dongarra.  Performance of various computers using standard linear equations software , 1990, CARN.

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

[30]  T. T. Narendran,et al.  Cell formation in manufacturing systems through simulated annealing: An experimental evaluation , 1992 .

[31]  George L. Nemhauser,et al.  Experiments with parallel branch-and-bound algorithms for the set covering problem , 1993, Oper. Res. Lett..

[32]  Larry W. Jacobs,et al.  A simulated annealing approach to the cyclic staff-scheduling problem , 1993 .