Gradual location set covering with service quality
Location set covering models were first described in the early 1970s. In their simplest form, they minimize the number of facilities necessary to completely cover a set of customers in some given space, where covering means providing service within a predetermined distance. This paper considers extensions of the basic model that soften the covered/not covered dichotomy and replace it with gradual covering. The models discussed in this work include the quality of service as a criterion. The models are formulated and compared with each other with respect to their size and features. A small series of computational tests concludes the paper.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Berman, Oded & Krass, Dmitry & Drezner, Zvi, 2003. "The gradual covering decay location problem on a network," European Journal of Operational Research, Elsevier, vol. 151(3), pages 474-480, December.
- Chang, Ching-Ter, 2001. "On the polynomial mixed 0-1 fractional programming problems," European Journal of Operational Research, Elsevier, vol. 131(1), pages 224-227, May.
- Berlin, Geoffrey N. & Liebman, Jon C., 1974. "Mathematical analysis of emergency ambulance location," Socio-Economic Planning Sciences, Elsevier, vol. 8(6), pages 323-328, December.
When requesting a correction, please mention this item's handle: RePEc:eee:soceps:v:43:y:2009:i:2:p:121-130. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.