Abstract
The flow capturing and thep-median location—allocation models deal quite differently with demand for service in a network. Thep-median model assumes that demand is expressed at nodes and locates facilities to minimize the total distance between such demand nodes and the nearest facility. The flow-capturing model assumes that demand is expressed on links and locates facilities to maximize the one-time exposure of such traffic to facilities. Demand in a network is often of both types: it is expressed by passing flows and by consumers centred in residential areas, aggregated as nodes. We here present a hybrid model with the dual objective of serving both types of demand. We use this model to examine the tradeoff between serving the two types of demand in a small test network using synthetic demand data. A major result is the counter-intuitive finding that thep-median model is more susceptible to impairment by the flow capturing objective than is the flow capturing model to thep-median objective. The results encourage us to apply the model to a real-world network using actual traffic data.
Similar content being viewed by others
References
LAMPS Users' Guide 1.56 (Advanced Mathematical Software, London, 1985).
O. Berman and D. Simchi-Levi, A heuristic algorithm for the travelling salesman location problem on networks, Oper. Res. 36(1988)478–484.
R.L. Church and C.S. ReVelle, The maximal covering location problem, Papers Regional Sci. Assoc. 32(1974)101–118.
J.L. Cohon,Multiobjective Programming and Planning (Academic Press, New York, 1978).
J.J. Flannery, The relative effectiveness of some common graduated point symbols in the representation of quantitative data, Can. Carographer 8(1971)96–109.
M.F. Goodchild and V.T. Noronha, Location-allocation and impulsive shopping: the case of gasoline retailing, in:Spatial Analysis and Location-Allocation Models, ed. A. Ghosh and G. Rushton (Van Nostrand Reinhold, 1987), pp. 121–136.
S.L. Hakimi, Optimum distribution of switching centers and the absolute centers and medians of a graph, Oper. Res. 12(1964)450–459.
S.L. Hakimi, Optimum distribution of switching centers in a communication network, and some related graph-theoretic problems, Oper. Res. 13(1965)462–475.
P. Hanjoul and D. Peeters, A comparison of two dual-based procedures for solving thep-mediar problem, Eur. J. Oper. Res. 20(1985)387–396.
M.J. Hodgson, A flow capturing location-allocation model, Geograph. Anal. 22(1990)270–279.
C.S. ReVelle, Urban public facility location, in:Handbook of Regional and Urban Economics, Vol. 2:Urban Economics, ed. E.S. Mills (North-Holland, Amsterdam, 1989), pp. 1053–1096.
C.S. ReVelle and R. Swain, Central facilities location, Geograph. Anal. 2(1970)30–42.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hodgson, M.J., Rosing, K.E. A network location-allocation model trading off flow capturing andp-median objectives. Ann Oper Res 40, 247–260 (1992). https://doi.org/10.1007/BF02060480
Issue Date:
DOI: https://doi.org/10.1007/BF02060480