Abstract
In this paper we consider the location of new facilities which serve only a certain proportion of the demand. The total weighted distances of the served demand is minimized. We consider the problem in the plane for the location of one facility and on a network for the location of m-facilities. Some computational experience with these models are reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aiken, C.H. (1985) Facility location models for distribution planning. European Journal of Operational Research, 22, 264–279.
Balinski, M. (1965) Integer programming: methods, uses, computation. Management Science, 12, 254–313.
Berman, O. and Krass, D. (2001) The generalized maximal covering location problem. Computers and Operations Research, 563–581.
Brimberg, J. and ReVelle, C. (1998) A bi-objective plant location problem: cost vs. demand served. Location Science, 6, 121–135.
Cooper, L. (1963) Location-allocation problems. Operations Research, 11, 331–343.
Cooper, L. (1964) Heuristic methods for location-allocation problems. SIAM Review, 6, 37–53.
Cornuejols, G., Fisher, M.L. and Nemhauser, G. (1977) Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Science, 23(8), 789–810.
Daskin, M.S. and Owen, S.H. (1999) Partial covering p-center and set covering problems: motivation, formulation and solution. Presented at ISOLDE VIII Conference, Portugal, June, 1999.
Drezner, Z. (1981) On a modified one-center model. Management Science, 27, 848–851.
Drezner, Z. and Wesolowsky G.O. (1994) Finding the circle or rectangle containing the minimum weight of points. Location Science, 2, 83–90.
Fisher, M.L. (1985) An application oriented guide to Lagrangian relaxation. Interfaces, 15(2), 10–21.
Galvao, R.D. (1993) The use of Lagrangean relaxation in the solution of uncapacitated facility location problems. Location Science, 1, 57–79.
Geoffrion, A.M. (1974) Lagrangian relaxation and its uses in integer programming. Mathematical Programming Study, 2, 82–114.
Hakimi, S.L. (1964) Optimal location of switching centers and the absolute centers and medians of a graph. Operations Research, 13, 462–475.
Jucker, J. and Carlson, R. (1976) The simple plant location problem under uncertainty. Operations Research, 24, 1045–1055.
Love, R.F., Morris, J.G. and Wesolowsky, G.O. (1988) Facilities Location: Models and Methods, North Holland, New York.
Nemhauser, G.L. and Garfinkel, R. (1972) Integer Programming, Wiley, New York.
Papadimitriou, C.H. and Steiglitz, K. (1982) Combinatorial Optimization Algorithms and Complexity, Prentice-Hall, Inc, Englewood Cliffs, NJ.
ReVelle, C. (1993) Facility siting and integer friendly programming. European Journal of Operational Research, 65, 147–158.
ReVelle, C. and Laporte, G. (1997) The plant location problem: new models and research prospects. Operations Research, 44, 864–874.
Sherali, H.D. and Rizzo, T.P. (1991) Unbalanced, capacitated p-median problem on a chain graph with continuum of link demands. Networks, 21, 133–169.
Watson-Gandy, C.D.T. (1982) Heuristic procedures for the M-partial cover problem on a plane. European Journal of Operational Research, 11, 149–157.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Berman, O., Drezner, Z. & Wesolowsky, G.O. Satisfying partial demand in facilities location. IIE Transactions 34, 971–978 (2002). https://doi.org/10.1023/A:1016182614026
Issue Date:
DOI: https://doi.org/10.1023/A:1016182614026