Minisum and minimax transfer point location problem with random demands points
This paper is concerned with analyzing some models of the weighted transfer point location problem under the minisum and minimax criterions when demand points are randomly distributed over regions of the plane and the location of the service facility is known. In case of minisum objective with rectilinear distance, an iterative procedure was constructed for estimating the optimal transfer point location using the hyperbolic application procedure. Exact analytic solution was obtained when the random demand points follow uniform distributions. A unified analytic optimal solution was provided for all types of probability distributions of the random demand points when the distance is the squared Euclidean distance. For minimax objective with squared Euclidean distance, an iterative procedure based on Karush-Kuhn-Tucker conditions was developed to produce an approximate solution to the optimal solution. Illustrative numerical examples were provided.
Art" , European Journal of Operational Research 190 (2008) 1-21.
 O. Berman and D. Krass, "Facility Location with Stochastic Demands and
Congestion", In Z. Drezner and H.W. Hamacher (eds.), Facility Location:
Applications and Theory, Springer, Berlin, 2001.
 O. Berman, O.J. Wang, Z. Drezner, and G.O. Wesolowsky, "The Minimax and
Maximin Location Problems with Uniform Distributed Weights", IIE
Transactions 35 (2003) 1017-1025.
 O. Berman, Z. Drezner, and G.O. Wesolowsky, "The facility and transfer points
location problem", International Transactions in Operational Research, 12
 O. Berman, J. Wang, "The 1-Median and 1-Antimedian Problems with
Continuous Probabilistic Demand Weights", Information Systems and
Operational Research, 44 (2006) 267-283
 O. Berman, O., Drezner, Z., and G.O. Wesolowsky, "The transfer point location problem", European journal of operational research, 179 (2007) 978-989.
 O. Berman, Z. Drezner, and G.O. Wesolowsky, "The multiple location of
transfer points", Journal of the Operational Research Society,
59 (2008) 805-811.
 J. Campbell,J., A. Ernst, and M. Krishnamoorthy, "Hub Location Problems", In
Zvi, D. and Horst, W. eds. Facility Location: Applications and Theory.
Heidelberg, Springer, Berlin, 2002.
 M.S. Canbolat and G.O. Wesolowsky, "The rectilinear distance Weber problem
in the presence of a probabilistic line barrier", European Journal of Operational
Research, 202 (2010) 114-121.
 W. Eyster, J.A. White, and W.W. Wierwille, "On solving multi-facility location
problems using a hyperboloid approximation procedure", AIIE Trans.,
5 (1973) 1-6.
 A. Foul, "A 1-center problem on the plane with uniformly distributed demand
points", Operations Research Letters, 34 (2006) 264-268.
 A.J. Goldman, "Optimal locations for centers in a network", Transportation
Science, 3 (1969) 352-360.
 S. A. Hosseinijou and M. Bashiri, "Stochastic models for transfer point location
problem", The International Journal of Advanced Manufacturing Technology,
58 (2012) 211-225.
 R.E. Love, J.G. Morris, and Wesolowsky, "Facilities Location : Models and
methods, North Holland, 1988.
 M.E. O'kelly, "The location of interacting hub facilities", Transportation
science, 20 (1986a) 92-106.
 M.E. O'kelly, "Activity levels at hub facilities in interacting networks",
Geographical Analysis, 18 (1986b) 343-356.
 M.E. O'kelly, "A quadratic integer program for the location of interacting hub
facilities", European Journal of Operational Research, 32 (1987) 393-404.
 J.B. Rosen and G.L. Xue, "On the convergence of a hyperboloid
approximation procedure for the perturbed Euclidean multi-facility location
problem", Operations Research 41(1993) 1164-1171.
 L.V. Snyder, "Facility location under uncertainty: a review", IIE Transactions
38 (2006) 537-554.
 A. Yousefli, H. Kalantari, and M. Ghazanfari, "Stochastic transfer point
location problem: A probabilistic rule-based approach", Uncertain Supply
Chain Management, 6 (2018) 65-74.
Copyright (c) 2021 Journal of Progressive Research in Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.