Abstract
In this paper we consider the single facility collection depots location problem in the plane where n weighted demand points and p collection depots are given. The service of a demand point consists of the travel from the facility to the demand point and returning back to the facility through a collection depot which provides the shortest route. The weights are drawn from independent continuous distributions , and the objective is to find the location such that the probability that the maximum weighted distance of the round trip exceeds a threshold is minimized. The problem is formulated and analyzed. Computational experience is reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Benkoczi R, Bhattacharya BK, Das S, Sember J (2009) Single facility collection depots location problem in the plane. Comput Geom Theory Appl 42:403–418
Benkoczi R, Bhattacharya B, Tamir A (2009) Collection depots facility location problems in trees. Networks 53:50–62
Berman O, Drezner Z, Wesolowsky GO (2002) The collection depots location problem on networks. Nav Res Logist 49:15–24
Berman O, Huang R (2004) MinSum collection depots location problem with multiple facilities on networks. J Oper Res Soc 55:769–779
Berman O, Krass D (2002) Facility location problem with stochastic demands and congestion. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory, 1st edn. Springer, Berlin, pp 329–371
Berman O, Wang J, Drezner Z, Wesolowsky GO (2003) A probabilistic minimax location problem on the plane. Annals Oper Res 122:59–70
Drezner Z, Suzuki A (2004) The big triangle small triangle method for the solution of nonconvex facility location problems. Oper Res 52:128–135
Drezner Z, Wesolowsky GO (2001) On the collection depots location problem. Eur J Oper Res 130:510–518
Hansen P, Peeters D, Thisse J (1981) On the location of an obnoxious facility. Sist Urbani 3:299–317
Marianov V, ReVelle C (1995) Siting emergency services. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, Berlin, pp 199–223
Plastria F (1992) GBSSS, the generalized big square small square method for planar single facility location. Eur J Oper Res 62:163–174
Tamir A, Halman N (2005) One-way and round-trip center location problems. Dis Opt 2:168–184
Wendell RE, Hurter AP (1973) Location theory, dominance, and convexity. Oper Res 21:314–320
Wesolowsky GO (1977) Probabilistic weights in the one-dimensional facility location problem. Manag Sci 24:224–229
Acknowledgments
This work is supported by the Scientific Research Foundation of Graduate School of Harbin University of Science and Technology (Grant No. HLGYCX2011-008), a foundation from the Ministry of Education of Heilongjiang Province (Grant No. 1251H013) and the National Nature Science Foundation of China (Grant Nos. 11371114, 11171082, and 11271103).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, D., He, C. & Wu, S. Single facility collection depots location problem with random weights. Oper Res Int J 16, 287–299 (2016). https://doi.org/10.1007/s12351-015-0200-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-015-0200-2