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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Araz C, Hasan S, Irem O (2007) A fuzzy multi objective covering-based vehicle location model for emergency services. Comput Oper Res 34:705–726
Bautista J, Pereira J (2006) A GRASP algorithm to solve the unicost set covering problem. Comput Oper Res 34(10):3162–3173
Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur J Oper Res 151(3):474–480
Chiang CI, Hwang MJ, Liu YH (2005) An alternative formulation for certain fuzzy set-covering problems. Math Comput Model 42:363–365
Church R, ReVelle C (1974) the maximal covering location problem. Papers Region Sci Assoc 32:101–118
Daskin MS (1995) Network and discrete location: Models, algorithms, and applications. Wiley, New York
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–1858
Francis RL, McGinnis LF, White JA (1992) Facility layout and location: An analytical approach. Prentice Hall, Englewood Cliffs, NJ
Hogan K, ReVelle C (1986) Concepts and applications of backup coverage. Manage Sci 32: 1434–1444
Hwang HS (2004) A stochastic set-covering location model for both ameliorating and deteriorating items. Comput Ind Eng 46:313–319
Jans R, Degraeve Z (2008) A note on a symmetrical set covering problem: the lottery problem. Eur J Oper Res 186(1):104–110
Jozefowieza N, Semetb F, Talbia EG (2007) The bi-objective covering tour problem. Comput Oper Res 34:1929–1942
Mirchandani PB, Francis RL (1990) Discrete location theory. Wiley, New York
Pirkul H, Schilling DA (1991) The maximal covering location problem with capacities on total workload. Manage Sci 37:233–248.
Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper Res 19:1363–1373
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Fallah, H., Sadigh, A.N., Aslanzadeh, M. (2009). Covering Problem. In: Zanjirani Farahani, R., Hekmatfar, M. (eds) Facility Location. Contributions to Management Science. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-2151-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-7908-2151-2_7
Published:
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-2150-5
Online ISBN: 978-3-7908-2151-2
eBook Packages: Business and EconomicsBusiness and Management (R0)