Skip to main content
SpringerLink
Log in

Algorithms for large scale set covering problems

  • Section V Set Covering And Set Partitioning
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper is concerned with the set covering problem (SCP), and in particular with the development of a new algorithm capable of solving large-scale SCPs of the size found in real-life situations. The set covering problem has a wide variety of practical applications which, in general, yield large and sparse instances, normally with hundreds of rows and thousands of columns. In this paper, we present an algorithm capable of solving problems of this size and test problems up to 400 rows and 4000 columns are solved. The method developed in this paper consists of a tree-search procedure based on a combination of decomposition and state space relaxation which is a technique developed for obtaining lower bounds on the dynamic program associated with a combinatorial optimization problem. The large size SCPs are decomposed into many smaller SCPs which are then solved or bounded by state space relaxation (SSR). Before using the decomposition and SSR, reductions both in the number of columns and the number of rows of the problem are made by applying Lagrangian relaxation, linear programming and heuristic methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.I. Ali and H. Thiagarajan, A network relaxation based enumeration algorithm for set partitioning, Eur. J. Oper. Res. 38(1989)76–85.

    Google Scholar 

  2. J.P. Arabeyre, J. Fearnley, F.C. Steiger and W. Teather, The airline crew scheduling problem: a survey, Transp. Sci. 3(1969)140–163.

    Google Scholar 

  3. E. Baker, Efficient heuristic algorithms for the weighted set covering problem, Comp. Oper. Res. 8(1981)303–310.

    Google Scholar 

  4. E. Baker and M. Fisher, Computational results for very large air crew scheduling problems, Omega 9(1981)613–618.

    Google Scholar 

  5. E. Balas, Cutting planes from conditional bounds: a new approach for set covering, Math. Progr. Study 12(1980)19–36.

    Google Scholar 

  6. E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study, Math. Progr. Study 12(1980)37–60.

    Google Scholar 

  7. E. Balas and M.W. Padberg, Set partitioning: a survey, SIAM Rev. 18(1976)710–760.

    Google Scholar 

  8. M.L. Balinski and R.E. Quandt, On an integer program for a delivery problem, Oper. Res. 12(1964)300–304.

    Google Scholar 

  9. R. Batta and N. Mannur, Covering-location models for emergency situations that require multiple response units, Manag. Sci. 36(1990)16–23.

    Google Scholar 

  10. J.E. Beasley, An algorithm for set covering problems, Eur. J. Oper. Res. 31(1983)501–510.

    Google Scholar 

  11. M. Belmore and H.D. Ratliff, Optimal defence of multi-commodity networks, Manag. Sci. 18(1971)174–185.

    Google Scholar 

  12. J. Bouliane and G. Laporte, Locating postal relay boxes using a set covering algorithm, Centre de Recherche sur les Transports, Publication #611, Université de Montréal (1989).

  13. M.A. Breuer, Simplification of the covering problem with application to Boolean expressions, J. ACM 17(1970)166–181.

    Google Scholar 

  14. G.G. Brown, G.W. Graves and D. Ronen, Scheduling occan transportation of crude oil, Manag. Sci. 33(1987)335–346.

    Google Scholar 

  15. N. Christofides, Zero-one programming using non-binary tree search, Comput. J. 14(1971)418–421.

    Google Scholar 

  16. N. Christofides, A minimax facility location problem and the cardinality constrained set covering problem, MSRR 375, Carnegie-Mellon University, Pittsburgh (1975).

    Google Scholar 

  17. N. Christofides and S. Korman, A computational survey of methods for the set covering problem, Manag. Sci. 21(1975)591–599.

    Google Scholar 

  18. N. Christofides, A. Mingozzi and P. Toth, State space relaxation procedures for the computation of bounds to routing problems, Networks 11(1981)145–164.

    Google Scholar 

  19. R. Church and C. Revelle, The maximal covering location problem, Regional Sci. 32(1974)101–118.

    Google Scholar 

  20. V. Chvátal, A greedy heuristic for the set covering problem, Math. Oper. Res. 4(1979)233–235.

    Google Scholar 

  21. H.W. Corley and S.D. Roberts, A partitioning problem with applications in regional design, Oper. Res. 20(1972)1010–1019.

    Google Scholar 

  22. R.H. Day, On optimal extracting from a multiple file data storage system: An application of integer programming, Oper. Res. 13(1965)482–494.

    Google Scholar 

  23. M. Desrochers and F. Soumis, A column generation approach to the urban transit crew scheduling, Transp. Sci. 23(1989)1–13.

    Google Scholar 

  24. J.J. Dongarra, Performance of various computers using standard linear equations software in aFortran environment, Technical Merorandum No. 23, Argonne National Laboratory (1987).

  25. M.E. Dyer, Calculating surrogate constraints, Math. Progr. 19(1980)255–278.

    Google Scholar 

  26. J. Etcheberry, The set covering problem. A new implicity enumeration algorithm, Oper. Res. 25(1977)760–772.

    Google Scholar 

  27. T.A. Feo and M. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Oper. Res. Lett. 8(1989)67–71.

    Google Scholar 

  28. M.L. Fisher and P. Kedia, Optimal solution of set covering problem/partitioning problems using dual heuristics, Oper. Res. Lett. 8(1989)67–71.

    Google Scholar 

  29. M.L. Fisher and M.B. Rosenwein, An interactive optimisation system for bulk-cargo ship scheduling, Naval Res. Log. 36(1989)27–42.

    Google Scholar 

  30. B.A. Foster and D.M. Ryan, An integer programming approach to the vehicle scheduling problem, Oper. Res. Quarterly 27(1976)367–384.

    Google Scholar 

  31. D.R. Freeman and J.V. Jucker, The line balancing problem, J. Ind. Eng. 18(1967)361–374.

    Google Scholar 

  32. R.S. Garfinkel and G. Nemhauser, The set-partitioning: Set covering with equality constraints, Oper. Res. 17(1969)848–856.

    Google Scholar 

  33. R.S. Garfinkel and G.L. Nemhauser, Optimal political districting by implicity enumeration techniques, Manag. Sci. 16(1979)B-495–B-508.

    Google Scholar 

  34. A.M. Geoffrion, Lagrangian relaxation and its use in integer programming, Math. Progr. Study 2(1970)82–114.

    Google Scholar 

  35. C. Ghiggi, P.P. Puliafito and R. Zoppoli, A combinatorial method for health-care districting, in:Optimization Techniques: Modelling and Optimization in the Service of Man, Part 1, Proc. 7th IFIP Conf. (Springer, 1976).

  36. J.P. Gimpel, A reduction technique for prime implicant tables, IEEE Trans. Electr. Comp. EC-14(1965)535–541.

    Google Scholar 

  37. G. Gunawardane, Dynamic versions of set covering type public facility location problems, Eur. J. Oper. Res. 10(1982)190–195.

    Google Scholar 

  38. E. Heurgon, Un problème de recouvrement: l'habillage des horaires d'une ligne d'autobus, RAIRO 1(1982)13–29.

    Google Scholar 

  39. M.H. Karwan and R.L. Rardin, Some relationships between Lagrangian and surrogate duality in integer programming, Math. Progr. 17(1979)320–334.

    Google Scholar 

  40. C.E. Lemke, H.M. Salkin and K. Spielberg, Set covering by a single-branch enumeration with linear-programming subproblems, Oper. Res. 19(1971)998–1022.

    Google Scholar 

  41. R.E. Marsten, The design of the XMP linear programming library, ACM Trans. Math. Software 7(1981)481–497.

    Google Scholar 

  42. R. Marsten and F. Shepardson, Exact solutions of crew scheduling problems using the set partitioning model: Recent successful applications, Networks 11(1981)167–177.

    Google Scholar 

  43. M. Minoux, Optimal traffic assignment in a SS/TDMA frame: An new approach by set covering and column generation, RAIRO 20(1986)273–286.

    Google Scholar 

  44. V. Nakornchai, Interactive computer methods for plant layout scheduling and group technology, Ph.D. Thesis, Department of Management Science, Imperial College, London (1982).

    Google Scholar 

  45. J.P. Paixão, Algorithms for large scale set covering problems, Ph.D. Thesis, Department of Management Science, Imperial College, London (1984).

    Google Scholar 

  46. J.P. Paixão, Transit crew scheduling on a personal workstation, in:Operational Research '90, ed. H.E. Bradley (Pergamon Press, New York, 1990) pp. 421–432.

    Google Scholar 

  47. M. Parker and B. Smith, Two approaches to computer crew scheduling, in:Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling, ed. A. Wren (North-Holland, 1981) pp. 193–222.

  48. C.S. Revelle, C. Toregas and L. Falkson, Applications of the location set covering problem, Geograph. Anal. 8(1976)65–76.

    Google Scholar 

  49. C. Ribeiro, M. Minoux and M.C. Penna, An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment, Eur. J. Oper. Res. 41(1989)232–239.

    Google Scholar 

  50. J. Rubin, A technique for the solution of massive set covering problems with application to airline crew scheduling, Transp. Sci. 7(1973)34–38.

    Google Scholar 

  51. M.E. Salvenson, The assembly line balancing problem, Trans. ASME 77(1955)939–947.

    Google Scholar 

  52. J.A.M. Schreuder, Application of a location to fire stations in Rotterdam, Eur. J. Oper. Res. 6(1981)212–219.

    Google Scholar 

  53. F. Shepardson and R.E. Marsten, A Lagrangian relaxation algorithm for the two duty period scheduling problem, Manag. Sci. 26(1980)2274–2281.

    Google Scholar 

  54. L. Steinberg, The background wiring problem: a placement algorithm, SIAM Rev. 3(1961)37.

    Google Scholar 

  55. F.J. Vasko, F.E. Wolf and K.L. Stott, Optimal selection of ingot sizes via set covering, Oper. Res. 15(1988)115–121.

    Google Scholar 

  56. F.J. Vasko and F.E. Wolf, Solving large set covering problems on a personal computer, Comp. Oper. Res. 35(1987)346–353.

    Google Scholar 

  57. W. Walker, Using the set-covering problem to assign fire companies to fire houses, Oper. Res. 22(1974)275–277.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Management School, Imperial College, SW7 2AZ, London, England, UK

    N. Christofides

  2. Departamento de Informática, Faculdade de Ciências de Lisboa, Bloco C5-Piso 1 — Campo Grande, 1700, Lisboa, Portugal

    J. Paixão

Authors
  1. N. Christofides
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Paixão
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Christofides, N., Paixão, J. Algorithms for large scale set covering problems. Ann Oper Res 43, 259–277 (1993). https://doi.org/10.1007/BF02025297

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02025297

Keywords

Search

Navigation