×

The gradual covering decay location problem on a network. (English) Zbl 1053.90076

Summary: In covering problems it is assumed that there is a critical distance within which the demand point is fully covered, while beyond this distance it is not covered at all. In this paper we define two distances. Within the lower distance a demand point is fully covered and beyond the larger distance it is not covered at all. For a distance between these two values we assume a gradual coverage decreasing from full coverage at the lower distance to no coverage at the larger distance.

MSC:

90B80 Discrete location and assignment
90B10 Deterministic network models in operations research
90C10 Integer programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Berman, O., The \(p\) maximal cover–\(p\) partial center problem on networks, European Journal of Operational Research, 72, 432-442 (1994) · Zbl 0809.90092
[2] Berman, O.; Krass, D., The generalized maximal covering location problem, Computers & Operations Research, 29, 563-581 (2002) · Zbl 0995.90056
[3] O. Berman, D. Krass, Constraint expansion and alternate formulations of the maximum cover and uncapacitated facility location problems, working paper, 2001; O. Berman, D. Krass, Constraint expansion and alternate formulations of the maximum cover and uncapacitated facility location problems, working paper, 2001
[4] Church, R. L.; Meadows, M. E., Location modeling utilizing maximum service distance criteria, Geographical Analysis, 11, 358-373 (1979)
[5] Church, R. L.; ReVelle, C., The maximal covering location problem, Papers of Regional Science Association, 32, 101-118 (1974)
[6] Cornuejols, M. L.; Nemhauser, G. L.; Wolsey, L. A., The uncapacitated facility location problem, (Mirchandani, P. B.; Francis, R. L., Discrete Location Theory (1990), John Wiley & Sons Inc: John Wiley & Sons Inc New York) · Zbl 0727.90043
[7] Drezner, Z., On a modified one-center problem, Management Science, 27, 848-851 (1981) · Zbl 0462.90027
[8] Drezner, Z., The \(p\)-cover problem, European Journal of Operational Research, 26, 312-313 (1986) · Zbl 0597.90028
[9] Z. Drezner, G.O. Wesolowsky, T. Drezner, The gradual covering problem, Working paper, College of Business, California State University, Fullerton, 2001; Z. Drezner, G.O. Wesolowsky, T. Drezner, The gradual covering problem, Working paper, College of Business, California State University, Fullerton, 2001 · Zbl 1075.90047
[10] Hochbaum, D. S.; Pathria, A., Analysis of the greedy approach in the problems of maximum \(k\)-coverage, Naval Research Logistics, 45, 615-627 (1998) · Zbl 0938.90026
[11] Jones, K.; Simmons, J., Location, Location, Location: Analyzing the Retail Environment (1993), Nelson Thomas Learning: Nelson Thomas Learning Scarborough, ON, Canada
[12] Kolen, A.; Tamir, A., Covering problems, (Mirchandani, P. B.; Francis, R. L., Discrete Location Theory (1990), John Wiley & Sons Inc: John Wiley & Sons Inc New York), 263-304 · Zbl 0747.90058
[13] Marianov, V.; ReVelle, C., Siting emergency services, (Drezner, Z., Facility Location: A Survey of Applications and Methods (1995), Springer-Verlag Inc: Springer-Verlag Inc New York), 199-223
[14] Megiddo, N.; Zemel, E.; Hakimi, S. L., The maximum coverage location problem, SIAM Journal on Algebraic and Discrete Methods, 4, 253-261 (1983) · Zbl 0514.90019
[15] Plastria, F., Continuous location problems, (Drezner, Z., Facility Location: A Survey of Applications and Methods (1995), Springer-Verlag Inc: Springer-Verlag Inc New York), 225-262
[16] Plastria, F., Continuous covering location problems, (Drezner, Z.; Hamacher, H., Facility Location: Applications and Theory (2001), Springer-Verlag: Springer-Verlag Berlin), 37-80 · Zbl 1013.90089
[17] ReVelle, C., The maximum capture or ‘sphere of influence’ location problem: hotelling revisited on a network, Journal of Regional Science, 26, 343-357 (1986)
[18] Rogers, C. A., Packing and Covering (1964), Cambridge University Press · Zbl 0176.51401
[19] Watson-Gandy, C., Heuristic procedures for the m-partial cover problem on a plane, European Journal of Operational Research, 11, 149-157 (1982) · Zbl 0495.52009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.