Abstract
Discrete location models often assume an underlying network where demands originate at point nodes. To apply these models to planar regions with continuously distributed demand, the region is usually partitioned into “zones” and the demand from each zone is assumed to originate at a point, usually the zone centroid. Thus, the point node in the underlying network represents a spatial zone with a finite area. This paper examines the effect of approximating these “spatial nodes” by point nodes. In some problem scenarios, the approximation does not affect the solution. However, especially when the locational criterion includes the consideration of intra-zonal travel cost variances (e.g. travel time variance) and demands may originate anywhere within zones of nonzero area, point nodes do not give an accurate evaluation of the performance of a locational design. To illustrate the application of the concept of spatial nodes, a model is formulated for locatingp (fire-fighting) units in a region having continuously distributed demand with the objective of minimizing a nonlinear function of arrival times of the first and second closest units to any (fire) incident. A heuristic “site-substitution” procedure is presented that solves the formulated model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Casillas, Data aagregation and thep-median problem in continuous space, Discussion Paper No. 35, Department of Geography, The University of Iowa, Iowa (1983).
M.F. Goodchild, The aggregation problem in location-allocation. Geographical Analyses 11(1979)240.
G. Handler and P. Mirchandani,Location on Networks, Theory and Algorithms (MIT Press, Cambridge, 1979).
T.E. Hendrick, D.R. Plane, C. Tomasides, D. Monarchi and F.W. Heiss, Denver fire services project report, Denver Urban Observatory, Denver, Colorado (1974).
E.L. Hillsman and R. Rhoda, Errors in measuring distances from populations to service centers, Annals of the Regional Science Association 12(1978)74.
R.L. Keeney, A method for districting among facilities, Oper. Res. 20(1972)613.
R.L. Keeney, A utility function for the response times of engines and ladders to fires, J. of Urban Analysis 1(1973)209.
P. Kolesar, A model for predicting average fire company travel times, R-1624, New York City-Rand Institute, New York (1975).
R.C. Larson and A.R. Odoni,Urban Operations Research (Prentice Hall, New Jersey, 1981).
F.E. Maranzana, On the location of supply points to minimize transport costs, Oper. Res. Quart. 15(1964)261.
P. Mirchandani and J. Reilly, Spatial distribution design for fire fighting units, in:Spatial Analysis and Location Allocation Models, ed. A. Ghosh and G. Rushton (Van Nostrand Reinhold Co., New York, 1986), to appear.
J. Reilly, Development of a fire station placement model with consideration of multiple arriving units, Ph.D. Dissertation, Rensselaer Polytechnic Institute, New York (1983).
M.I. Shamos, Computational geometry, Ph.D. Dissertation, Department of Computer Science, Yale University, New Haven, CT (1978).
M.B. Teitz and P. Bart, Heuristic methods for estimating the generalized vertex median of a weighted graph, Oper. Res. 16(1968)955.
United States Department of Housing and Urban Development,Deployment Methodology for Fire Departments (Government Printing Office, Washington, D.C., 1977).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mirchandani, P.B., Reilly, J.M. “Spatial nodes” in discrete location problems. Ann Oper Res 6, 201–222 (1986). https://doi.org/10.1007/BF02024583
Issue Date:
DOI: https://doi.org/10.1007/BF02024583