Median Location Problem

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


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


Polling Station Heuristic Algorithm Target Function Mixed Integer Linear Programming Tabu Search Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Alba E, Dominquez E (2006) Comparative analysis of modern optimization tools for the p-median problem. Stat Comput 16:251–260CrossRefGoogle Scholar
  2. Beasley JE (1988) An algorithm for solving large capacitated warehouse location problems Eur J Oper Res 33:314–325Google Scholar
  3. Bramel J, Simchi-Levi D (1998) The logic of logistic Springer Series in Oper ResGoogle Scholar
  4. ChristoEdes N, Beasley JE (1983) Extensions to a lagrangian relaxation approach for the capacitate warehouse location problem Eur J Oper Res 12:19–28Google Scholar
  5. 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–297Google Scholar
  6. Correa ES, Steiner MTA, Freitas AA, Carnieri C (2004) Genetic algorithm for solving a capacitated p-median problem. Numer Algorithms 35:373–388CrossRefGoogle Scholar
  7. Francis RL, McGinnis LF, White JA (1992) Facility layout and location: An analytical approach. Prentice Hall, Englewood Cliffs, NJGoogle Scholar
  8. Galvao RD (1980) A dual-bounded algorithm for the p-median problem. J Oper Res 28(5): 1112–1121CrossRefGoogle Scholar
  9. GeoIrion AM, McBride R (1978) Lagrangian relaxation applied to capacitated facility location problem AIIE Trans 1:40–47Google Scholar
  10. 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–1912Google Scholar
  11. Goldman AJ (1971) Optimal center location in simple networks. Trans. Sci., 5:212–221CrossRefGoogle Scholar
  12. Guinard M, Kim S (1987) A strong lagrangian relaxation for capacitated plant location problems Math Program 39:215–528Google Scholar
  13. Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and Medians of a graph. Eur J Oper Res 12(3):450–459CrossRefGoogle Scholar
  14. 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–475CrossRefGoogle Scholar
  15. Jacobsen SK (1983) Heuristics for the capacitated plant location model Eur J Oper Res 12:253–261CrossRefGoogle Scholar
  16. Jarvinen P, Rajala J, Sinervo V (1972) A branch-and-bound algorithm for seeking the p median. Eur J Oper Res 20(1):173–178CrossRefGoogle Scholar
  17. Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. II. The p-medians. SIAM J Appl Math 37(3):539–560CrossRefGoogle Scholar
  18. Khumawala BM (1974) An efficient heuristic procedure for the capacitated warehouse location problem Nav Res Logist Quart 21:609–623CrossRefGoogle Scholar
  19. Leung JM, Magnanti TL (1989) Valid inequalities and facets of the capacitated plan location problem Math Program 44:271–291Google Scholar
  20. Lorenaa L, Senneb E (2004) A column generation approach to capacitated p-median problems Oper Res 31:863–876Google Scholar
  21. Mirchandani PB, Francis RL (1990) Discrete location theory. Wiley, New YorkGoogle Scholar
  22. Narula SC, Ogbu UI, Samuelsson HM (1968) An algorithm for the p-Median problem. Eur J Oper Res 16(5):955–961CrossRefGoogle Scholar
  23. Neebe AW (1978) A branch and bound algorithm for the p-median transportation problem. J Oper Res Soc 29:989–995Google Scholar
  24. Reese J (2005) Methods for solving the p-median problem: An annotated bibliography. Technical report, Department of Mathematics, Trinity UniversityGoogle Scholar
  25. Revelle C, Swain R (1970) Central facilities location. Geograph Anal 2:30–42CrossRefGoogle Scholar
  26. Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Eur J Oper Res 16(5):955–961CrossRefGoogle Scholar
  27. Van Roy TJ (1985) A cross decomposition algorithm for capacitated facility location. Eur J Oper Res 34:145–63Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Department of Industrial EngineeringAmirkabir University of TechnologyTehranIran

Personalised recommendations