Abstract
This paper presents an algorithm for determining a minimax location to service demand points that are equally weighted and distributed over a sphere. The norm under consideration is geodesic. The algorithm presented here is based on enumeration and has a polynomial time complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. Akin and A.J.G. Babu, “Constrained large region multifacility location problems, ” Journal of Operational Research Society, vol. 38, pp. 241–252, 1987.
A.A. Aly, D.C. Kay, and D.W. Litwhiler, “Location dominance on a spherical surface”, Operations Research, vol. 27, pp. 972–981, 1979.
R.K. Chakraborty and P.K. Chaudhuri, “Note on geometrical solutions for some minimax location problems, ” Transportation Science, vol. 15, pp. 164–166, 1981.
P. Das, N.R. Chakraborty, and P.K. Chaudhuri, “A polynomial time algorithm for a hemispherical minimax location problem, ” Operations Research Letters, vol. 24, pp. 57–63, 1999.
U.R. Dhar and J.R. Rao, “A comparative study of three norms for facility location problems on spherical surface, ” New Zealand Journal of Operational Research, vol. 8, pp. 173–183, 1982.
U.R. Dhar and J.R. Rao, “Domain approximation method for solving multifacility location problems on a sphere, ” Journal of Operational Research Society, vol. 33, pp. 639–645, 1982.
Z. Drezner, “On location dominance on spherical surfaces, ” Operations Research, vol. 29, pp. 1218–1219, 1981.
Z. Drezner, “Constrained location problems in the plane and on a sphere, ” IIE Transactions, vol. 15, pp. 300–304, 1983.
Z. Drezner and G.O. Wesolowsky, “Facility location on a sphere, ” Journal of Operations Research Society, vol. 29, pp. 997–1004, 1978.
Z. Drezner and G.O. Wesolowsky, “Minimax and maximin facility location problems on a sphere, ” Naval Research Logistics Quarterly, vol. 30, pp. 305–312, 1983.
J. Elzinga and D.W. Hearn, “Geometrical solutions for some minimax location problems, ” Transportation Science, vol.6, pp. 379–394, 1972.
R.L. Francis, L.F. McGinnis, and J.A. White, Facility Layout and Location: An Analytic Approach, Prenice—Hall: Englewood, N.J., 1992.
D.W. Hearn and J. Vijay, “Efficient algorithms for the (Weighted) minimum circle problem, ” Operations Research, vol. 39, pp. 777–795, 1982.
I.N. Katz and L. Cooper, “Optimal location on a sphere, ” Computers and Mathematics with Applications, vol. 6, pp. 175–196, 1980.
D.W. Litwhiler, “Large region location problem, ” Ph.D. Thesis, The University of Oklahoma, Norman, O.K, 1977.
D.W. Litwhiler and A.A. Ally, “Large region location problems, ” Computers and Operations Research, vol.6, pp. 1–12, 1979.
D.W. Litwhiler and A.A. Ally, “Minimax location problems on the sphere, ” I.E. Research Report 81–12 (School of Industrial Engineering), University of Oklahoma, Norman, O.K., 1981.
R. Love, L.G. Morris, and G.O. Wesolowsky, Facility Location: Models and Methods, North-Holland: New York, 1988.
N. Megiddo, “Linear time algorithm for linear programming in R3 and related problems, ” SIAM J. Comput., vol. 12, pp. 759–776, 1983.
K.P.K. Nair and R. Chandrasekaran, “Optimal location of a single service center of certain types, ” Naval Research Logistics Quarterly, vol. 18, pp. 503–510, 1971.
B.J. Oommen, “An efficient geometric solution to minimum spanning circle problem, ” Operations Research, vol. 35, pp. 80–86, 1987.
M.H. Patel, “Spherical minimax location problem using the Euclidean norm: Formulation and Optimization, ” Computational Optimization and Applications, vol. 4, pp. 79–90, 1995.
M.H. Patel, D.L. Nettles, and S.J. Deutsch, “A linear programming-based method for determining whether or not n demand points are on a hemisphere, ” Naval Research Logistics, vol. 40, pp. 543–552, 1993.
A.K. Sarkar and P.K. Chaudhuri, “Solution of equiweighted minimax problem on a hemisphere, ” Computational Optimization and Applications, vol. 6, pp. 73–82, 1996.
M.I. Shamos, “Computational geometry, ” Ph.D. Thesis, Dept. of Computer Science, Yale University, 1978.
I. Todhunter and J.G. Leathem, “Spherical trigonometry, ” Macmillan & Co. Ltd., 1960.
W.H. Tsai, M.S. Chern, and T.M. Lin, “An algorithm for determining whether m demand points are on a hemisphere or not, ” Transportation Science, vol. 25, pp. 91–97, 1991.
G.O. Wesolowsky, “Location problems on a sphere, ” Regional Science Urban Economics, vol. 12, pp. 495–508, 1982.
G. Xue and C. Wang, “The Euclidean facilities location problem, ” in Advances in Optimization and Approximation, D.Z. Du and J. Sun (Eds.), Kluwer Academic Publishers: Boston, pp. 313–331, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Das, P., Chakraborti, N. & Chaudhuri, P. Spherical Minimax Location Problem. Computational Optimization and Applications 18, 311–326 (2001). https://doi.org/10.1023/A:1011248622793
Issue Date:
DOI: https://doi.org/10.1023/A:1011248622793