Skip to main content
Log in

A network location-allocation model trading off flow capturing andp-median objectives

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. LAMPS Users' Guide 1.56 (Advanced Mathematical Software, London, 1985).

  2. O. Berman and D. Simchi-Levi, A heuristic algorithm for the travelling salesman location problem on networks, Oper. Res. 36(1988)478–484.

    Article  Google Scholar 

  3. R.L. Church and C.S. ReVelle, The maximal covering location problem, Papers Regional Sci. Assoc. 32(1974)101–118.

    Article  Google Scholar 

  4. J.L. Cohon,Multiobjective Programming and Planning (Academic Press, New York, 1978).

    Google Scholar 

  5. J.J. Flannery, The relative effectiveness of some common graduated point symbols in the representation of quantitative data, Can. Carographer 8(1971)96–109.

    Google Scholar 

  6. 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.

  7. S.L. Hakimi, Optimum distribution of switching centers and the absolute centers and medians of a graph, Oper. Res. 12(1964)450–459.

    Article  Google Scholar 

  8. S.L. Hakimi, Optimum distribution of switching centers in a communication network, and some related graph-theoretic problems, Oper. Res. 13(1965)462–475.

    Article  Google Scholar 

  9. 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.

    Article  Google Scholar 

  10. M.J. Hodgson, A flow capturing location-allocation model, Geograph. Anal. 22(1990)270–279.

    Google Scholar 

  11. 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.

    Google Scholar 

  12. C.S. ReVelle and R. Swain, Central facilities location, Geograph. Anal. 2(1970)30–42.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02060480

Keywords

Navigation