Abstract
An effective new algorithm is presented for positioning service stations for calls which come from a subset of the line. The coordinate of a call is a random quantity which has a distribution density with compact support. The asymptotic second order optimality of this algorithm is found. A necessary optimality condition of positioning stations for a family of optimality criteria is also found.
Similar content being viewed by others
References
L. V. Nazarov and S. N. Smirnov, “Service of calls distributed in the space,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 1, 95–99 (1982).
T. V. Zakharova, “The optimization of the spatial location of service stations,” Inform. Primen. 2 (2), 41–46 (2008).
T. V. Zakharova and A. A. Fisak, “A necessary condition for the optimal location of service stations on a segment for a parametric family of optimality criteria,” in Statistical Methods for Estimating and Testing Hypotheses (Permsk. Gos. Univ., Perm’, 2015), Vol. 26, pp. 86–94 [in Russian].
T. V. Zakharova, “Optimization of spatial location of mass service stations,” Cand. Sci. (Phys. Math.) Dissertation (Mosc. State Univ., Moscow, 2008).
L. F. Tóth, Lagerungen in der Ebene, auf der Kugel und im Raum (Springer, New York, 1953; Fizmatlit, Moscow, 1958) [in German].
E. B. Saff and A. B. J. Kuijlaars, “Distributing many points on a sphere,” Math. Intellig. 19 (1), 5–11 (1997).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © T.V. Zakharova, A.A. Fisak, 2018, published in Vestnik Moskovskogo Universiteta, Seriya 15: Vychislitel’naya Matematika i Kibernetika, 2018, No. 2, pp. 40–47.
About this article
Cite this article
Zakharova, T.V., Fisak, А.А. Optimal Positioning of Service Stations. MoscowUniv.Comput.Math.Cybern. 42, 89–96 (2018). https://doi.org/10.3103/S0278641918020085
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0278641918020085