Abstract
The p-median problem was first formulated as an integer-linear programming problem by ReVelle and Swain (1970) and further revised by Rosing, ReVelle and Rosing-Vogelaar (1979). These two forms have withstood the test of time, as they have been used by virtually everyone since then. We prove that a property associated with geographical proximity makes it possible to eliminate many of the model variables through a substitution process. This new substitution technique has resulted in the elimination of up to 60% of the variables needed in either of these classic model formulations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balinski, M. (1965). “Integer Programming Methods, Uses and Computation.” Management Science (Ser. A) 12, 253–313.
Beasley, J.E. (1993). “Lagrangean Heuristics for Location Problems.” European Journal of Operational Research 65, 383–399.
Church, R.L. and tP. Sorensen. (1995). “Integrating Normative Location Models into GIS: Problems and Prospects for the p-Median Problem.” In P. Longley and M. Batty (eds.), Spatial Analyses: Modelling in a GIS Environment. Cambridge: GeoInformation International.
Densham, P.J. and tG. Rushton. (1992a). “Strategies for Solving Large Location–Allocation Problems by Heuristic Methods.” Environment and Planning A 24, 289–304.
Densham, P.J. and tG. Rushton. (1992b). “A More Efficient Heuristic for Solving Large p-Median Problems.” Papers in Regional Science 71, 307–329.
Eaton, D.J., tR.L. Church, V.L. Bennett, B.L. Hamon, and L.G. Valencia-Lopez. (1981). “On Deployment of Health Resources in Rural Valle Del Cauca, Colombia.” TIMS Studies in the Management Sciences 17, 331–359.
Efroymson, M. and tT. Ray. (1966). “A Branch and Bound Algorithm for Plant Location.” Operations Research 14, 361–368.
Erlenkotter, D. (1978). “A Dual Based Procedure for Uncapacitated Facility Location.” Operations Research 26, 992–1009.
Hakimi, S.L. (1964). “Optimum Location of Switching Centers and the Absolute Centers and Medians of a Graph.” Operations Research 12, 450–459.
Hakimi, S.L. (1965). “Optimum Distribution of Switching Centers and Some Graph-Related Theoretic Problems.” Operations Research 13, 462–475.
Hanjuol, P. and tD. Peters. (1985). “A Comparison of two Dual-Based Procedures for Solving the p-Median Problem.” European Journal of Operational Research 20, 387–396.
Hillsman, E.L. (1979). “A System for Location–Allocation Analysis.” Ph.D. Dissertation, Iowa City, University of Iowa.
Hillsman, E.L. (1984). “The p-Median Structure as a Unified Linear Model for Location–Allocation Analysis.” Environment and Planning A 16, 205–318.
Hosage, C. and tM. Goodchild. (1986). “Discrete Space Location–Allocation Solutions from Genetic Algorithms.” Annals of Operations Research 6, 35–46.
Murray, A.T. and tR.L. Church. (1996). “Applying Simulated Annealing to Location–Planning Models.” Journal of Heuristics 2, 31–53.
Narula, S.C., tU.I. Ogbu, and H.M. Samuelson. (1977). “An Algorithm for the p-Median Problem.” Operations Research 25, 709–713.
ReVelle, C. (1987). “Urban Public Facility Location.” In E.S. Mills (ed.), Handbook of Regional and Urban Economics, Vol. 2. Amsterdam: Elsevier Science.
ReVelle, C.S. (1993). “Facility Siting and Integer Friendly Programming.” European Journal of Operational Research 65, 147–158.
ReVelle, C.S. and tR. Swain. (1970). “Central Facilities Location.” Geographical Analysis 2, 30–42.
Rolland, E., tD. Schilling, and J.R. Current. (1996). “An Efficient Tabu Search Procedure for the p-Median Problem.” European Journal of Operational Research 96, 329–342.
Rosing, K.E. and tC.S. ReVelle. (1997). “Heuristic Concentration: Two-Stage Solution Concentration.” European Journal of Operational Research 97, 75–86.
Rosing, K.E., tC.S. ReVelle, and H. Rosing-Vogelaar. (1979). “The p-Median and its Linear Programming Relaxation: An Approach to Large Problems.” Journal of the Operational Research Society 30, 815–822.
Ruggles, A. and tR.L. Church. (1994). “An Analysis of Late-Horizon Settlement Patterns in the Teotihuacan–Temascalapa Basins: A Location–Allocation and GIS Based Approach.” In M.S. Aldenderfer and H.D.G. Maschner (eds.), Anthropology, Space, and Geographic Information Systems. Oxford: Oxford University Press.
Sorensen, P.A. and tR.L. Church. (1996). “A Comparison of Strategies for Data Storage Reduction in Location-Allocation Problems.” Geographical Systems 3, 221–242.
Teitz, M.B. and tP. Bart. (1968). “Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph.” Operations Research 16, 955–961.
Waters, N. (1996). Personal Communication.
Weaver, J.R. and tR.L. Church. (1985). “AMedian LocationModel with Nonclosest Facility Service.” Transportation Science 19, 58–74.
Whitaker, R.A. (1981). “A Tight Bound Drop Exchange Algorithm for Solving the p-Median Problem.” Environment and Planning A 13, 669–680.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Church, R.L. COBRA: A New Formulation of the Classic p-Median Location Problem. Annals of Operations Research 122, 103–120 (2003). https://doi.org/10.1023/A:1026142406234
Issue Date:
DOI: https://doi.org/10.1023/A:1026142406234