Robust 1-Median Location Problems: Dynamic Aspects and Uncertainty

  • Panos Kouvelis
  • Gang Yu
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 14)


In Chapter 2, Example 9, we introduced the robust 1-median location on a tree problem, and later in the same chapter we introduced a variation of this problem referred to as the dynamically robust 1-median location on a tree. The robust 1-median on a tree problem, as introduced in Chapter 2, addresses the location of a single facility on a tree network in the presence of significant uncertainty in the node weights (node demands) and edge lengths (transportation cost). Uncertainty is modeled with the use of multiple scenarios, where a scenario is a complete specification of the uncertain node demands and/or edge lengths. The dynamically robust 1-median location problem, as introduced in Example 10 of Chapter 2, uses again multiple data scenarios, however the multiplicity of scenarios is not caused by parameter uncertainty but by the dynamic evolution of the parameters of the location decision model (i.e., dynamic evolution of node demands and/or transportation costs). The purpose of this chapter is to propose a unifying approach for incorporating dynamic aspects (i.e., variation over time) and/or uncertainty of important input data (i.e., parameters of the decision model) in the location decision making process. The problem under consideration is a 1-median problem on a tree. All points of the network, nodes or not, are eligible for locating the facility. The weights (demands) of the various nodes are either of a dynamic nature or uncertain.


Location Problem Transportation Cost Edge Length Interval Data Node Demand 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Chen, B. and C.S. Lin (1994), “Robust One Median Location Problem,” Working Paper, Department of Management and Systems, Washington State University, Pullman, Washington.Google Scholar
  2. [2]
    Drezner Z. and G.O. Wesolowsky (1991), “Facility Location when Demand is Time Dependent,” Naval Research Logistics, 38, 763–777.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    Dyer, M.E. (1984), “Linear Time Algorithms for Two- and Three Variable Linear Programs,” SIAM J. Computing, 13, 1, 31–45.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    Erkut E. and B.C. Tansel (1992), “On Parametric Medians of Trees,” Transportation Science, 26, 2, 149–156.zbMATHCrossRefGoogle Scholar
  5. [5]
    Frank H. (1966), “Optimum Locations on a Graph with Probabilistic Demands,” Operations Research, 14, 409–421.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    Frank H. (1967), “Optimum Locations on Graphs with Correlated Normal Demands,” Operations Research, 15, 552–557.zbMATHCrossRefGoogle Scholar
  7. [7]
    Goldman, A.J. (1971), “Optimal Center Location in Simple Networks,” Transportation Science, 5, 212–221.MathSciNetCrossRefGoogle Scholar
  8. [8]
    Hakimi, S.L. (1964), “Optimal Location of Switching Centers and the Absolute Centers and Medians of a Graph,” Operations Research, 12, 450–459.zbMATHCrossRefGoogle Scholar
  9. [9]
    Kouvelis, P., G. Vairaktarakis and G. Yu (1993), “Robust 1-Median Location on a Tree in the Presence of Demand and Transportation Cost Uncertainty,” Working Paper, Fuqua School of Business, Duke University (latest revision to be referenced is Kouvelis et al. (1996)).Google Scholar
  10. [10]
    Labbe M., J.R. Thisse and R. E. Wendell (1991), “Sensitivity Analysis in Minisum Facility Location Problems,” Operations Research, 39, 6, 961–969.MathSciNetzbMATHCrossRefGoogle Scholar
  11. [11]
    Mirchandani, P.B. and R.L. Francis (1990), Discrete Location Theory, John Wiley & Sons, New York.zbMATHGoogle Scholar
  12. [12]
    Mirchandani, P.B. and A.R. Odoni (1979), “Location of Medians on Stochastic Networks,” Transportation Science, 13, 85–97.MathSciNetCrossRefGoogle Scholar
  13. [13]
    Mirchandani, P.B., A. Oudjit and R. Wong (1985), “Multidimensional Extensions and a Nested Dual Approach for the m-Median Problem,” Eu-ropean Journal of Operational Research, 21, 121–137.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14]
    Oudjit A. (1981), “Median Locations on Deterministic and Probabilistic Multidimensional Networks,” Ph.D. Dissertation, RPI, Troy, New York.Google Scholar
  15. [15]
    Tansel, B.C. (1986), “Simple Facility Minisum Location on a Network with Parametric Vertex Weights,” Working Paper. Industrial and Systems Engineering Department, University of Southern California.Google Scholar
  16. [16]
    Tansel, B.C. and G.F. Scheuenstuhl (1988), “Facility Location on Tree Networks with Imprecise Data,” Research Report: IEOR-8819. Department of Industrial Engineering, Bilkent University, Ankara, Turkey.Google Scholar
  17. [17]
    Vairaktarakis, G. and P. Kouvelis (1996), “Incorporating Dynamic Aspects and Uncertainty in 1-Median Location Problems,” Working Paper, College of Business Administration, Marquette University, Milwaukee.Google Scholar
  18. [18]
    Weaver J.R. and R.L. Church (1983), “Computational Procedures of Location Problems on Stochastic Networks,” Transportation Science, 17, 168–180.CrossRefGoogle Scholar
  19. [19]
    Wesolowsky, G.O. (1977), “Probabilistic Weights in One Dimensional Facility Location Problem,” Management Science, 24, 224–229.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1997

Authors and Affiliations

  • Panos Kouvelis
    • 1
  • Gang Yu
    • 2
  1. 1.Olin School of BusinessWashington University at St. LouisSt. LouisUSA
  2. 2.Center for Cybernetic StudiesThe University of TexasAustinUSA

Personalised recommendations