Abstract
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The main characteristics of the algorithm we propose are (1) a dynamic pricing scheme for the variables, akin to that used for solving large-scale LP's, to be coupled with subgradient optimization and greedy algorithms, and (2) the systematic use of column fixing to obtain improved solutions. Moreover, we propose a number of improvements on the standard way of defining the step-size and the ascent direction within the subgradient optimization procedure, and the scores within the greedy algorithms. Finally, an effective refining procedure is proposed. Extensive computational results show the effectiveness of the approach.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Balas and M. C. Carrera, “A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering”, Management Sciences Research Report No. MSSR 568(R), GSIA, Carnegie-Mellon University, October 1991, revised May 1995.
E. Balas and A. Ho, “Set Covering Algorithms Using Cutting Planes, Heuristics and Subgradient Optimization: A Computational Study”, Mathematical Programming Study 12 (1980) 37–60.
J.E. Beasley, “A Lagrangian Heuristic for Set Covering Problems”, Naval Research Logistics 37 (1990) 151–164.
J.E. Beasley, “OR-Library: Distributing Test Problems by Electronic Mail”, Journal of the Operational Research Society 41 (1990) 1069–1072.
J.E. Beasley and P.C. Chu, “A Genetic Algorithm for the Set Covering Problem”, Working Paper, The Management School, Imperial College, London, July 1994.
S. Ceria, P. Nobili, and A. Sassano, “A Lagrangian-Based Heuristic for Large-Scale Set Covering Problems”, Working Paper, University of Roma La Sapienza, June 1995.
J.J. Dongarra, “Performance of Various Computers Using Standard Linear Equations Software”, Technical Report No. CS-89-85, Computer Science Department, University of Tennessee, November 1993.
M.L. Fisher and P. Kedia, “Optimal Solutions of Set Covering/Partitioning Problems Using Dual Heuristics”, Management Science 36 (1990) 674–688.
M. Held and R.M. Karp, “The Traveling Salesman Problem and Minimum Spanning Trees: Part II”, Mathematical Programming 1 (1971) 6–25.
L.A.N. Lorena and F.B. Lopes, “A Surrogate Heuristic for Set Covering Problems”, European Journal of Operational Research 79 (1994) 138–150.
D. Wedelin, “An Algorithm for Large Scale 0-1 Integer Programming with Application to Airline Crew Scheduling”, Annals of Operational Research (to appear) (1995).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caprara, A., Fischetti, M., Toth, P. (1996). A heuristic algorithm for the set covering problem. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 1996. Lecture Notes in Computer Science, vol 1084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61310-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-61310-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61310-7
Online ISBN: 978-3-540-68453-4
eBook Packages: Springer Book Archive