Two new heuristics for the location set covering problem

SummaryIn 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.

[1]  G. Nemhauser,et al.  Integer Programming , 2020 .

[2]  D. Schilling,et al.  Facility location: a review of context-free and EMS models. , 1977, Health services research.

[3]  Warren Walker,et al.  Using the Set-Covering Problem to Assign Fire Companies to Fire Houses , 1974, Oper. Res..

[4]  Francis J. Vasko,et al.  Selecting Optimal Ingot Sizes for Bethlehem Steel , 1989 .

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

[6]  Charles ReVelle,et al.  Review, extension and prediction in emergency service siting models , 1989 .

[7]  R. Roth,et al.  Computer Solutions to Minimum-Cover Problems , 1969, Oper. Res..

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

[9]  F. J. Vasko,et al.  Hybrid heuristics for minimum cardinality set covering problems , 1986 .

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

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

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

[13]  Roy E. Marsten,et al.  Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.

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

[15]  Roy E. Marsten,et al.  Crew Planning at Flying Tiger: A Successful Application of Integer Programming , 1979 .

[16]  Andrew C. Ho.  Worst case analysis of a class of set covering heuristics , 1982, Math. Program..