Advertisement

Covering Problem

  • Hamed Fallah
  • Ali Naimi Sadigh
  • Marjan Aslanzadeh
Chapter
Part of the Contributions to Management Science book series (MANAGEMENT SC.)

Abstract

In many covering problems, services that customers receive by facilities depend on the distance between the customer and facilities. In a covering problem the customer can receive service by each facility if the distance between the customer and facility is equal or less than a predefined number. This critical value is called coverage distance or coverage radius and shown by Dc.

Church and Revelle (1974) modeled the maximization covering problem. Covering problems are divided into two branches; tree networks and general networks, according to their graph. In addition, these problems are divided into two problems: Total covering and partial covering problems, based on covering all or some demand points.

Keywords

Covering Problem Demand Point Supportive Center Reduction Rule Tree Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Araz C, Hasan S, Irem O (2007) A fuzzy multi objective covering-based vehicle location model for emergency services. Comput Oper Res 34:705–726CrossRefGoogle Scholar
  2. Bautista J, Pereira J (2006) A GRASP algorithm to solve the unicost set covering problem. Comput Oper Res 34(10):3162–3173CrossRefGoogle Scholar
  3. Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur J Oper Res 151(3):474–480CrossRefGoogle Scholar
  4. Chiang CI, Hwang MJ, Liu YH (2005) An alternative formulation for certain fuzzy set-covering problems. Math Comput Model 42:363–365CrossRefGoogle Scholar
  5. Church R, ReVelle C (1974) the maximal covering location problem. Papers Region Sci Assoc 32:101–118CrossRefGoogle Scholar
  6. Daskin MS (1995) Network and discrete location: Models, algorithms, and applications. Wiley, New YorkCrossRefGoogle Scholar
  7. Farahani R, Asgari N (2007) Combination of MCDM and covering techniques in a hierarchical model for facility location: A case study. Eur J Oper Res 176(3):1839–1858CrossRefGoogle Scholar
  8. Francis RL, McGinnis LF, White JA (1992) Facility layout and location: An analytical approach. Prentice Hall, Englewood Cliffs, NJGoogle Scholar
  9. Hogan K, ReVelle C (1986) Concepts and applications of backup coverage. Manage Sci 32: 1434–1444CrossRefGoogle Scholar
  10. Hwang HS (2004) A stochastic set-covering location model for both ameliorating and deteriorating items. Comput Ind Eng 46:313–319CrossRefGoogle Scholar
  11. Jans R, Degraeve Z (2008) A note on a symmetrical set covering problem: the lottery problem. Eur J Oper Res 186(1):104–110CrossRefGoogle Scholar
  12. Jozefowieza N, Semetb F, Talbia EG (2007) The bi-objective covering tour problem. Comput Oper Res 34:1929–1942CrossRefGoogle Scholar
  13. Mirchandani PB, Francis RL (1990) Discrete location theory. Wiley, New YorkGoogle Scholar
  14. Pirkul H, Schilling DA (1991) The maximal covering location problem with capacities on total workload. Manage Sci 37:233–248.CrossRefGoogle Scholar
  15. Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper Res 19:1363–1373CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hamed Fallah
    • 1
  • Ali Naimi Sadigh
    • 1
  • Marjan Aslanzadeh
    • 2
  1. 1.Department of Industrial EngineeringAmirkabir University of TechnologyTehranIran
  2. 2.Graduate School of BusinessUniversity of WollongongNSWAustralia

Personalised recommendations