Document Type : Original Article
Author
Department of Computer science, Faculty of Mathematical sciences, University of Guilan, Rasht, Iran
Abstract
In this paper, we consider the Euclidean continuous minimax location problem under uncertainty. We consider the single-facility and the multi-facility case with uncertain location of demand points and uncertain transportation costs. We study these two problems under two kinds of uncertainty, the interval and the ellipsoidal uncertainty. Equivalent formulations of robust counterparts of the single facility and multi facility Euclidean continuous minimax location problems under interval and
ellipsoidal uncertainty are given as conic optimization
problems.
Keywords
[1] Drezner, Z., Hamacher, H. (2002). Facility location: Applications and Theory, Springer-Verlag, Berlin.
[2] Francis, R., McGinnis, Jr. L. F., White, J.A. (1992). Facility Layout and Location: An Analytical Approach, Prentice Hall.
[3] Love, R. F., Morris, J. G., Wesolowsky, G. O. (1988). Facilities Location: Models and Methods, North Holland Publishing Company, New York.
[4] Mirchandani, P. B., Francis, R. L. (1990). Discrete Location Theory, John Wiley.
[5] Hakimi, S. L. (1964). Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 12(3), 450-459.
[6] Smallwood, R. D. (1965). Minimax detection station placement. Operations Research, 13(4), 632-646.
[7] Elzinga, D. J., Hearn, D. W. (1972). The minimum covering sphere problem. Management Science, 19(1), 96-104.
[8] Elzinga, J., Hearn, D. W. (1972). Geometrical solutions for some minimax location problems. Transportation Science, 6(4), 379-394.
[9] Hearn, D. W., Vijay, J. (1982). Efficient algorithms for the (weighted) minimum circle problem. Operations Research, 30(4), 777-795.
[10] Dearing, P. M., Francis, R. L. (1974). A network flow solution to a multifacility minimax location problem involving rectilinear distances. Transportation Science, 8(2), 126-141.
[11] Morris, J. G. (1973). A linear programming approach to the solution of constrained multi-facility minimax location problems where distances are rectangular. Journal of the Operational Research Society, 24(3), 419-435.
[12] Francis, R. L. (1967). Some aspects of a minimax location problem. Operations Research, 15(6), 1163-1169.
[13] Hakimi, S. L. (1965). Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research, 13(3), 462-475.
[14] Wesolowsky, G. O. (1972). Rectangular distance location under the minimax optimality criterion. Transportation Science, 6(2), 103-113.
[15] Zukhovitskiy, S. I., & Avdeyeva, L. I. (1966). Linear and Convex Programming, trans. Scripta Technica. Inc. Philadelphia, Penn.: WB Saunders Co.
[16] Frank, H. (1966). Optimum locations on a graph with probabilistic demands. Operations Research, 14(3), 409-421.
[17] Frank, H. (1967). Optimum locations on graphs with correlated normal demands. Operations Research, 15(3), 552-557.
[18] Levy, J. (1967). An extended theorem for location on a network. Operational Research Quarterly, 18(4), 433.
[19] Snyder, L. V. (2006). Facility location under uncertainty: a review. IIE Transactions, 38(7), 547-564.
[20] Baron, O., Milner, J., Naseraldin, H. (2011). Facility location: a robust optimization approach. Production and Operations Management, 20(5), 772-785.
[21] Jamalian, A., Salahi, M. (2014). Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty. Applied Mathematics and Computation, 242, 179-186.
[22] Nikoofal, M. E., Sadjadi, S. J. (2010). A robust optimization model for p-median problem with uncertain edge lengths. The International Journal of Advanced Manufacturing Technology, 50(1-4), 391-397.
[23] Averbakh, I., Berman, O. (1997). Minimax regret p-center location on a network with demand uncertainty. Location Science, 5(4), 247-254.
[24] Averbakh, I., Berman, O. (2000). Algorithms for the robust 1-center problem on a tree. European Journal of Operational Research, 123(2), 292-302.
[25] Averbakh, I., Berman, O. (2000). Minmax regret median location on a network under uncertainty. INFORMS Journal on Computing, 12(2), 104-110.
[26] Burkard, R. E., Dollani, H. (2001). Robust location problems with pos/neg weights on a tree. Networks, 38(2), 102-113.
[27] Carrizosa, E., Nickel, S. (2003). Robust facility location. Mathematical Methods of Operations Research, 58(2), 331-349.
[28] Wang, L., & Huang, N. J. (2012). Robust solutions to uncertain weighted least squares problems. Mathematical Communications, 17(2), 525-535.
[29] Drezner, Z., & Wesolowsky, G. O. (1978). A new method for the multifacility minimax location problem. Journal of the Operational Research Society, 29(11),1095-1101.
[30] Charalambous, C. (1981). An iterative algorithm for the multifacility minimax location problem with Euclidean distances. Naval Research Logistics Quarterly, 28(2), 325-337.
)