##
**Weber problems with mixed distances and regional demand.**
*(English)*
Zbl 1146.90464

Summary: 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.

### MSC:

90B85 | Continuous location |

90C15 | Stochastic programming |

90C31 | Sensitivity, stability, parametric optimization |

PDF
BibTeX
XML
Cite

\textit{M. Gugat} and \textit{B. Pfeiffer}, Math. Methods Oper. Res. 66, No. 3, 419--449 (2007; Zbl 1146.90464)

Full Text:
DOI

### References:

[1] | Butazzo G, Santambrogio F (2005) A model for the optimal planning of an urban area. SIAM J Math Anal 37:514–530 · Zbl 1109.49027 |

[2] | Carrizosa E, Munoz-Marquez M, Puerto J (1998) The Weber problem with regional demand. Euro J Oper Res 104:358–365 · Zbl 0955.90063 |

[3] | Carrizosa E, Plastria F (1996) A characterization of efficient points in constrained location problems with regional demand. Oper Res Lett 19:129–134 · Zbl 0866.90101 |

[4] | Carrizosa E, Rodriguez-Chia AM (1997) Weber problems with alternative transportation system. Euro J Oper Res 97:87–93 · Zbl 0923.90111 |

[5] | Chang C-T, Chang C-C (2000) A linearization method for mixed 0-1 polynomial programs. Comput Oper Res 27:1005–1016 · Zbl 0970.90055 |

[6] | Fekete SP, Mitchell JSB, Beurer K (2005) On the continuous Fermat–Weber problem. Oper Res 53:61–76 · Zbl 1165.90553 |

[7] | Horst R, Tuy H (1990) Global optimization. Springer, Berlin · Zbl 0704.90057 |

[8] | Koshizuka T, Kurita O (1991) Approximate formulas of average distances associated with regions and their application to location problems. Math Program 52:99–123 · Zbl 0733.90042 |

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

[10] | 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 |

[11] | Pfeiffer B (2006) Path planning and location problems with varying environments. PhD thesis, Institute of Applied Mathematics, University of Erlangen-Nuremberg, Shaker Verlag, Aachen · Zbl 1106.90049 |

[12] | Pfeiffer B, Klamroth K (2004) Bilinear programming formulations for Weber problems with continuous and network distances. J Oper Res Soc Jpn 48:123–134 · Zbl 1274.90241 |

[13] | Schweitzer PA (1968) Moments of distances of uniformly distributed points. AMS Month 75:802–804 |

[14] | Wendell RE, Hurter AP (1973) Location theory, dominance and convexity. Oper Res 21:314–320 · Zbl 0265.90040 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.