Summary
In this paper we present two new greedy-type heuristics for solving the location set covering problem. We compare our new pair of algorithms with the pair GH1 and GH2 [Vasko and Wilson (1986)] and show that they perform better for a selected set of test problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baker, E. (1981).Heuristics algorithms for the weighted set covering problem. Computers and Operations Research8(4), 303–310.
Balas, E. and A. Ho (1980).Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. Mathematical Programming12, 37–60.
Beasley, J.E. (1990a).A lagrangian heuristic for set covering problem. Naval Research Logistics Quaterly37, 151–164.
Beasley, J.E. (1990b).OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society41, 1069–1072.
Garfinkel, R.S. and G.L. Nemhauser (1972). Integer programming, Wiley, New York.
Ho, A.C. (1982).Worst case analysis of a class of set covering heuristics. Mathematical Programming23(2), 170–180.
Karp, R.M. (1972). Reducibility among combinatorial problems, inComplexity of computer computations (R.E. Miller and J.W. Thatcher, Eds.), Plenium Press, New York, 85–104.
Marsten, R.E., M.R. Muller and Killion (1979).Crew planning at Flying Tiger: a successful application of integer programming. Management Science20, 779–787.
Marsten, R.E. and F. Shepardson (1981).Exact solutions of erew schedulling problems using the set partitioning problem: Recent successful applications. Networks11, 165–177.
Revelle, C. (1989).Review, Extension and Prediction in Emergency Service Siting Models. European Journal of Operations Research,40, 58–69.
Revelle, C., D. Bigman, J. Cohon and R. Church (1977).Facility Location: A Review of Context-Free and EMS Models. Health Services Research12, 129–146.
Roth, R. (1969).Computer solutions to minimum-cover problems. Operations Research17, 455–465.
Salverson, M.E. (1955).The assambly line balancing problem. Journal of Industrial Engineering6, 18–25.
Toregas, C., R. Swain, C. Revelle and L. Bergman (1971).The location of emergency services facilities. Operations Research19, 1363–1373.
Vasko, F.J. and G.R. Wilson (1984).An efficient heuristic for large set covering problems. Naval Research Logistics Quaterly31, 163–171.
Vasko, F.J. and G.R. Wilson (1986).Hybrid Heuristics for Minimum Cardinality set covering problems. Naval Research Logistics Quaterly33, 241–249.
Vasko, F.J., F.E. Wolf, K.L. Stott and J.W. Scheirer (1989).Selecting Optimal Ingot Sizes for Bethlehem Steel. Interfaces19/1, 68–84.
Walker, W. (1974).Application of the set covering problem to the assignment of ladder trucks to fire house. Operations Research22, 275–277.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Almiñana, M., Pastor, J.T. Two new heuristics for the location set covering problem. Top 2, 315–328 (1994). https://doi.org/10.1007/BF02574812
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02574812