Skip to main content
SpringerLink
Log in

Weber problems with mixed distances and regional demand

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

We consider a location problem where the distribution of the existing facilities is described by a probability distribution and the transportation cost is given by a combination of transportation cost in a network and continuous distance. The motivation is that in many cases transportation cost is partly given by the cost of travel in a transportation network whereas the access to the network and the travel from the exit of the network to the new facility is given by a continuous distance.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Butazzo G, Santambrogio F (2005) A model for the optimal planning of an urban area. SIAM J Math Anal 37:514–530

    Article  MathSciNet  Google Scholar 

  • Carrizosa E, Munoz-Marquez M, Puerto J (1998) The Weber problem with regional demand. Euro J Oper Res 104:358–365

    Article  MATH  Google Scholar 

  • Carrizosa E, Plastria F (1996) A characterization of efficient points in constrained location problems with regional demand. Oper Res Lett 19:129–134

    Article  MATH  MathSciNet  Google Scholar 

  • Carrizosa E, Rodriguez-Chia AM (1997) Weber problems with alternative transportation system. Euro J Oper Res 97:87–93

    Article  MATH  Google Scholar 

  • Chang C-T, Chang C-C (2000) A linearization method for mixed 0-1 polynomial programs. Comput Oper Res 27:1005–1016

    Article  MATH  MathSciNet  Google Scholar 

  • Fekete SP, Mitchell JSB, Beurer K (2005) On the continuous Fermat–Weber problem. Oper Res 53:61–76

    Article  MathSciNet  MATH  Google Scholar 

  • Horst R, Tuy H (1990) Global optimization. Springer, Berlin

    MATH  Google Scholar 

  • Koshizuka T, Kurita O (1991) Approximate formulas of average distances associated with regions and their application to location problems. Math Program 52:99–123

    Article  MATH  MathSciNet  Google Scholar 

  • Love RF (1972) A computational procedure for optimally locating a facility with respect to several rectangular regions. J Reg Sci 12:233–242

    Article  Google Scholar 

  • Ouyang Y, Daganzo CF (2003) Discretization and validation of the continuum approximation scheme for terminal systems design. Inst Trans Stud Working Paper 2:1–28

    Google Scholar 

  • Pfeiffer B (2006) Path planning and location problems with varying environments. PhD thesis, Institute of Applied Mathematics, University of Erlangen-Nuremberg, Shaker Verlag, Aachen

  • Pfeiffer B, Klamroth K (2004) Bilinear programming formulations for Weber problems with continuous and network distances. J Oper Res Soc Jpn 48:123–134

    MathSciNet  Google Scholar 

  • Schweitzer PA (1968) Moments of distances of uniformly distributed points. AMS Month 75:802–804

    Article  MathSciNet  Google Scholar 

  • Wendell RE, Hurter AP (1973) Location theory, dominance and convexity. Oper Res 21:314–320

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl 2 für Angewandte Mathematik, Martensstr. 3, 91058, Erlangen, Germany

    Martin Gugat & Barbara Pfeiffer

Authors
  1. Martin Gugat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barbara Pfeiffer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Gugat.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gugat, M., Pfeiffer, B. Weber problems with mixed distances and regional demand. Math Meth Oper Res 66, 419–449 (2007). https://doi.org/10.1007/s00186-007-0165-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-007-0165-x

Keywords

Mathematical Subject Classification

Search

Navigation