The fixed charge maximal covering location problem
Tóm tắt
The maximal covering location problem is based on locatingp facilities in such a manner that coverage is maximized within set distance or time standards. This problem has been extended in a number of different ways where the main theme still involves locating a fixed number of facilities. In many applications site costs are not equal; this should cast doubt on the use of a constraint that fixes the number of facilities at a given number as compared to an approach that minimizes site costs and maximizes coverage. This paper addresses the use of site costs in a maximal covering location problem and presents several approaches to solutions, along with computational results. Theoretical linkages to other location models are also presented.
Tài liệu tham khảo
Church, R. L., and ReVelle, C. S. 1974. The maximal covering location problem.Papers of the Regional Science Association 31: 101–18.
Cohon, J. L. 1978.Multiobjective programming and planning. Orlando, Florida: Academic Press.
Daskin, M. S. 1983. A maximum expected covering location model: formulation, properties, and heuristic solution.Transportation Science 17: 48–70.
Erlenkotter, D. 1976. A dual-based procedure for uncapacitated facility location.Operations Research 26: 992–1009.
Hogan, K., and ReVelle, C. 1986. Concepts and applications of backup coverage.Management Science 32: 1434–44.
Mavrides, L. P. 1979. An indirect method for the generalizedk-median problem applied to lockbox location.Management Science 25: 990–96.
Plane, D. R., and Hendrick, T. E. 1977. Mathematical programming and the location of fire companies for the Denver Fire Department.Operations Research 25: 563–78.
ReVelle, C. 1989. Review, extension and prediction in emergency service siting models.European Journal of Operations Research 40: 58–69.
ReVelle, C., and Swain, R. 1970. Central facilities location.Geographical Analysis 2: 30–42.
Swain, R. 1971. A decomposition algorithm for a class of facility location problems. Ph.D. dissertation, School of Civil and Environmental Engineering, Cornell University, Ithaca, New York.
Toregas, C., and ReVelle, C. 1973. Binary logic solutions to a class of location problem.Geographical Analysis 5: 145–55.
Vasko, F. J., and Wolf, F. E. 1988. Solving large set covering problems on a personal computer.Computers and Operations Research 15: 115–21.
Weaver, J. R., and Church, R. L. 1983. A comparison of solution procedures for covering location problems.Proceedings of the Fourteenth Annual Pittsburgh Conference 14 (Part 4): 1417–22.