Skip to main content

Median Location Problem

  • Chapter
  • First Online:
Facility Location

Part of the book series: Contributions to Management Science ((MANAGEMENT SC.))

Abstract

The median problem is considered as the main problems identified with the location-allocation problems (see Chap. 5). These problems are intended to find the median points among the candidate points, so that the sum of costs can be minimized through this target function. These kinds of problems include the establishment of the public services including schools, hospitals, firefighting, Ambulance, technical audit stations of cars, and etc. The target function in the median problems is of the minisum kind. In fact in these problems we try to quantify the sum of distances (costs).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Alba E, Dominquez E (2006) Comparative analysis of modern optimization tools for the p-median problem. Stat Comput 16:251–260

    Article  Google Scholar 

  • Beasley JE (1988) An algorithm for solving large capacitated warehouse location problems Eur J Oper Res 33:314–325

    Google Scholar 

  • Bramel J, Simchi-Levi D (1998) The logic of logistic Springer Series in Oper Res

    Google Scholar 

  • ChristoEdes N, Beasley JE (1983) Extensions to a lagrangian relaxation approach for the capacitate warehouse location problem Eur J Oper Res 12:19–28

    Google Scholar 

  • Cornuejols G, Sridharan R, Thizy JM (1991) A comparison of heuristics and relaxations for the capacitated plant location problem Eur J Oper Res 50:280–297

    Google Scholar 

  • Correa ES, Steiner MTA, Freitas AA, Carnieri C (2004) Genetic algorithm for solving a capacitated p-median problem. Numer Algorithms 35:373–388

    Article  Google Scholar 

  • Francis RL, McGinnis LF, White JA (1992) Facility layout and location: An analytical approach. Prentice Hall, Englewood Cliffs, NJ

    Google Scholar 

  • Galvao RD (1980) A dual-bounded algorithm for the p-median problem. J Oper Res 28(5): 1112–1121

    Article  Google Scholar 

  • GeoIrion AM, McBride R (1978) Lagrangian relaxation applied to capacitated facility location problem AIIE Trans 1:40–47

    Google Scholar 

  • Ghiani G, Guerriero F, Musmanno R (2002) The capacitated plant location problem with multipli facilities in the same site. Eur J Oper Res 29:1903–1912

    Google Scholar 

  • Goldman AJ (1971) Optimal center location in simple networks. Trans. Sci., 5:212–221

    Article  Google Scholar 

  • Guinard M, Kim S (1987) A strong lagrangian relaxation for capacitated plant location problems Math Program 39:215–528

    Google Scholar 

  • Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and Medians of a graph. Eur J Oper Res 12(3):450–459

    Article  Google Scholar 

  • Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Eur J Oper Res 13(3):462–475

    Article  Google Scholar 

  • Jacobsen SK (1983) Heuristics for the capacitated plant location model Eur J Oper Res 12:253–261

    Google Scholar 

  • Jarvinen P, Rajala J, Sinervo V (1972) A branch-and-bound algorithm for seeking the p median. Eur J Oper Res 20(1):173–178

    Article  Google Scholar 

  • Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. II. The p-medians. SIAM J Appl Math 37(3):539–560

    Article  Google Scholar 

  • Khumawala BM (1974) An efficient heuristic procedure for the capacitated warehouse location problem Nav Res Logist Quart 21:609–623

    Google Scholar 

  • Leung JM, Magnanti TL (1989) Valid inequalities and facets of the capacitated plan location problem Math Program 44:271–291

    Google Scholar 

  • Lorenaa L, Senneb E (2004) A column generation approach to capacitated p-median problems Oper Res 31:863–876

    Google Scholar 

  • Mirchandani PB, Francis RL (1990) Discrete location theory. Wiley, New York

    Google Scholar 

  • Narula SC, Ogbu UI, Samuelsson HM (1968) An algorithm for the p-Median problem. Eur J Oper Res 16(5):955–961

    Article  Google Scholar 

  • Neebe AW (1978) A branch and bound algorithm for the p-median transportation problem. J Oper Res Soc 29:989–995

    Google Scholar 

  • Reese J (2005) Methods for solving the p-median problem: An annotated bibliography. Technical report, Department of Mathematics, Trinity University

    Google Scholar 

  • Revelle C, Swain R (1970) Central facilities location. Geograph Anal 2:30–42

    Article  Google Scholar 

  • Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Eur J Oper Res 16(5):955–961

    Article  Google Scholar 

  • Van Roy TJ (1985) A cross decomposition algorithm for capacitated facility location. Eur J Oper Res 34:145–63

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Masoomeh Jamshidi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Physica-Verlag Heidelberg

About this chapter

Cite this chapter

Jamshidi, M. (2009). Median Location Problem. In: Zanjirani Farahani, R., Hekmatfar, M. (eds) Facility Location. Contributions to Management Science. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-2151-2_8

Download citation

Publish with us

Policies and ethics