Multifacility Location Problem

  • Farzaneh Daneshzand
  • Razieh Shoeleh
Part of the Contributions to Management Science book series (MANAGEMENT SC.)


In the previous chapter, we studied the case of a single new facility to be located relative to a number of existing facilities. In this chapter we consider the problem of optimally locating more than one new facilities with respect to locations of a number of existing facilities (demand points), the locations of which are known.

While the problems are natural extension of those of single facility location, there are two important conditions:

1. At least two facilities are to be located

2. Each new facility is linked to at least one other new facility

If the first condition contracted, this problem is considered as a single facility location problem (SFLP) and if the second condition contracted, we can consider the problem as some of independent single facility location problems. Thus the SFLP can be considered as a spatial case of the multifacility location problem (MFLP).


Objective Function Location Problem Dual Problem Facility Location Demand Point 
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. Allen WR (1995) An improved bound for the multifacility location model. Oper Res Lett 17(4):175–180CrossRefGoogle Scholar
  2. Aly AA, Marucheck AS (1982) Generalized Weber problem with rectangular regions. J Oper Res Soc 33(11):983–989Google Scholar
  3. Aykin T, Babu AJG (1987) Multifacility location problems on a sphere. Int J Math Math Sci 10(3):583–596CrossRefGoogle Scholar
  4. Cabot AV, Francis RL, Stary MA (1970) A network flow solution to a rectilinear distance facility location problem. AIIE Trans 2(2):132–141CrossRefGoogle Scholar
  5. Calamai PH, Charalambous C (1980) Solving multifacility location problem involving euclidean distances. Naval Res Logist Quart 27:609–620CrossRefGoogle Scholar
  6. Calamai PH, Conn AR (1980) A stable algorithm for solving the multifacility location problem involving euclidean distances. SIAM J Sci Stat Comput 1:512–525CrossRefGoogle Scholar
  7. Calamai PH, Conn AR (1982) A Second-order method for moving the continuous multifacility location problem. In: Watson GA (ed) Numerical analysis: proceeding of the ninth biennial conference, Dundee, Scotland, Lecture Notes in Mathematics, vol 912. Springer, Berlin, pp 1–25Google Scholar
  8. Calamai PH, Conn AR (1987) A projected Newton method for Lp norm location problems. Math Program 38:75–109CrossRefGoogle Scholar
  9. Carrizosa E, Conde E, Fernandez FR, Puerto J (1993) Efficiency in euclidean constrained location problems. Oper Res Lett 14:291–295CrossRefGoogle Scholar
  10. Chatelon JA (1978) A subgradient algorithm for certain minimax and minisum Problems. Math Program 15:130–145CrossRefGoogle Scholar
  11. Cheung To-Yat (1980) Multifacility location problem with rectilinear distance by the minimum-Cut approach. ACM Trans Math Softw 6(3):387–390CrossRefGoogle Scholar
  12. Davoud Pour H, Nosraty M (2006) Solving the facility and layout and location problem by ant-colony optimization-metaheuristic. Int J Prod Res 44(23):5187–5196CrossRefGoogle Scholar
  13. Dax A (1986) An efficient algorithm for solving the rectilinear multifacility location problem. IMA J Numer Anal 6:343–355CrossRefGoogle Scholar
  14. Dearing PM, Francis RL (1974) A network flow solution to a multifacility minimax location problem involving rectangular distances. Transport Sci 9:126–141CrossRefGoogle Scholar
  15. Dhar UR, Rao JR (1982) domain approximation method for solving multifacility location problems on a sphere. J Oper Res Soc 33(7):639–645Google Scholar
  16. Drezner Z, Wesolowsky GO (1978) A trajectory method for the optimization of the multifacility location problem with distances. Manage Sci 24(14):1507–1514CrossRefGoogle Scholar
  17. Elzinga DJ, Hearn DW (1973) A note on a minimax location problem. Transport Sci 7:100–103.CrossRefGoogle Scholar
  18. Elzinga DJ, Hearn DW (1983) On stopping rules for facilities location algorithm. AIIE Trans 15:81–82Google Scholar
  19. Elzinga DJ, Hearn DW, Randolph WR (1976) Minimax multifacility location with euclidean distances. Transport Sci 10(4):321–336CrossRefGoogle Scholar
  20. Eyster JW, White JA (1973) Some properties of the squared euclidean distance location problem. AIIE Trans 5(3):275–280CrossRefGoogle Scholar
  21. Eyster JW, White JA, Wierwille WW (1973) On solving multifacility location problems using a hyperboloid approximation procedure. AIIE Trans 5:1–6CrossRefGoogle Scholar
  22. Francis RL (1964) On the location of multiple new facilities with respect to existing facilities. J Ind Eng 15(2):106–107Google Scholar
  23. Francis RL, Cabot AV (1972) Properties of a multifacility location problem involving euclidean distances. Naval Res Logist Quart 19:335–353CrossRefGoogle Scholar
  24. Francis RL, McGinnis LF, White JA (1983) Locational analysis. Eur J Oper Res 12:220–252CrossRefGoogle Scholar
  25. Francis RL, McGinnis LF, White JA (1992) Facility layout and location: an analytical approach, 2nd edn. Prentice Hall, Englewood Cliffs, NJGoogle Scholar
  26. Idrissi HO, Lefebvre, Michelot (1989) Duality constrained multifacility location problems with mixed norms and applications. Ann Oper Res 18:71–92CrossRefGoogle Scholar
  27. Juel H (1984) On a rational stopping rule for facilities location algorithms. Naval Res Logist Quart 31:9–11CrossRefGoogle Scholar
  28. Juel H, Love RF (1976) An efficient computational procedure for solving the multifacility rectilinear facilities location problem. Oper Res Quart 27(3):697–703CrossRefGoogle Scholar
  29. Juel H, Love RF (1980) Sufficient conditions for optimal facility location to coincide. Transport Sci 14:125–129CrossRefGoogle Scholar
  30. Kolen A (1981) Equivalence between the direct search approach and the cut approach to the rectilinear distance location problem. Oper Res 29(3):616–620CrossRefGoogle Scholar
  31. Lefebvere O, Michelot C, Plastria F (1991) Sufficient conditions for coincidence in minisum multifacility location problem with a general metric. Oper Res 39(3):437–442CrossRefGoogle Scholar
  32. Love RF (1969) Locating facilities in three-dimensional space by convex programming. Naval Res Logist Quart 16(4):503–516Google Scholar
  33. Love RF (1972) A computational procedure for optimally locating a facility with respect to several rectangular regions. J Region Sci 12(2):233–242CrossRefGoogle Scholar
  34. Love RF (1974) The dual of a hyperbolic approximation to the generalized constrained multifacility location problem with lp distances. Manage Sci 21:22–33CrossRefGoogle Scholar
  35. Love RF, Dowling PD (1989) A generalized bounding method for multifacility location models. Oper Res 37(4):653–657CrossRefGoogle Scholar
  36. Love RF, Kraemer S (1973) A dual decomposition method for minimizing transportation costs in multifacility location problems. Transport Sci 7(4):297–316CrossRefGoogle Scholar
  37. Love RF, Yoeng WY (1981) A stopping rule for facilities location algorithms. AIIE Trans 13:357–362CrossRefGoogle Scholar
  38. Love RF, Wesolowsky GO, Kraemer SA (1973) A multifacility minimax location method for euclidean distances. Int J Prod Res 11(1):37–45CrossRefGoogle Scholar
  39. Mazzerella F, Pesamosca G (1996) The analytical solution of some EMFL minisum problems. Isolde VII, June 25–July 3Google Scholar
  40. Morris JG (1973) A linear programming approach to the solution of constrained multifacility minimax location problems where distances are rectangular. Oper Res Quart 24:419–435CrossRefGoogle Scholar
  41. Morris JG (1975) Linear programming solution to the generalized rectangular distance weber problem. Naval Res Logist Quart 22:155–164CrossRefGoogle Scholar
  42. Ostresh LM (1977) The multifacility location problem: applications and descent theorems. J Region Sci 17:409–419CrossRefGoogle Scholar
  43. Picard J, Ratliff HD (1978) A cut approach to the rectilinear distance facility location problem. Oper Res 26(3):422–433CrossRefGoogle Scholar
  44. Pritsker AAB, Ghare PM (1970) locating new facilities with respect to existing facilities. AIIE Trans 2(4):290–297CrossRefGoogle Scholar
  45. Rado F (1988) The euclidean multifacility location Problem. Oper Res 36(3):485–492CrossRefGoogle Scholar
  46. Rao MR (1973) On the direct search approach to the rectilinear facilities location problem. AIIE Trans 5(3):256–264CrossRefGoogle Scholar
  47. Rosen JB, Xue GL (1992) A globally convergent algorithm for solving the euclidean multifacility location problem. Acta Math Appl Sin 8(4):357–366Google Scholar
  48. Rosen JB, Xue GL (1993) On the Convergence of a hyperboloid approximation procedure for the perturbed euclidean multifacility location problem. Oper Res 41(6):1164–1171CrossRefGoogle Scholar
  49. Seppalla Y (1975) On a Stochastic multifacility location problem. AIIE Trans 7(1):56–62CrossRefGoogle Scholar
  50. Sherali HD, Shetty CM (1978) A primal simplex based solution procedure for the rectilinear distance multifacility location problem. J Oper Res Soc 29(4):373–381Google Scholar
  51. Sinha SM (1966) A duality theorem for nonlinear programming. Manage Sci 12:385–390CrossRefGoogle Scholar
  52. Smallwood RD (1965) Minimal detection station placement. Oper Res 13(4):632–646CrossRefGoogle Scholar
  53. Thomas GB (1968) Chlculus and analytic geometry. AddisonWesley, Reading, MAGoogle Scholar
  54. Vergin RC, Rogers JD (1967) An algorithm and computational procedure for locating economic facilities. Manage Sci 3(6):240–254Google Scholar
  55. Wendell RE, Petersen EL (1984) A dual approach for obtaining lower bounds to the weber problem. J Region Sci 24:219–228CrossRefGoogle Scholar
  56. Wesolowsky GO (1972) Rectangular distance location under minimax optimality criterion. Transport Sci 6:103–113CrossRefGoogle Scholar
  57. Wesolowsky GO, Love RF (1971a) Location of facilities with rectangular distances among point and area destinations. Naval Res Logist Quart 18:83–90CrossRefGoogle Scholar
  58. Wesolowsky GO, Love RF (1971b) The optimal location of new facilities using rectangular distances. Oper Res 19(1):124–130CrossRefGoogle Scholar
  59. Wesolowsky GO, Love RF (1972) A nonlinear approximation method for solving a generalized rectangular distance weber problem. Manage Sci 18(11):656–663CrossRefGoogle Scholar
  60. Wesolowsky GO, Truscott GW (1976) Dynamic location of multiple facilities for a class of continuous problems. AIIE Trans 8(1):76–83Google Scholar
  61. White DJ (1976) An analogue derivation of the dual of the general fermat problem. Manage Sci 23:92–94CrossRefGoogle Scholar
  62. White JA (1971) A quadratic facility location problem. AIIE Trans 3(2):156–157CrossRefGoogle Scholar
  63. Xue GL, Rosen JB, Pardalos PM (1996) A polynomial time dual algorithm for the euclidean multifacility location problem. Oper Res Lett 18:201–204CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Department of Industrial EngineeringAmirkabir University of TechnologyTehranIran
  2. 2.Department of Industrial EngineeringAmirkabir University of TechnologyTehranIran

Personalised recommendations