Email this article Optimal Positioning of Service Stations
- Authors: Zakharova T.V.1,2, Fisak А.А.1
-
Affiliations:
- Faculty of Computational Mathematics and Cybernetics
- Institute of Informatics Problems
- Issue: Vol 42, No 2 (2018)
- Pages: 89-96
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176234
- DOI: https://doi.org/10.3103/S0278641918020085
- ID: 176234
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
T. V. Zakharova
Faculty of Computational Mathematics and Cybernetics; Institute of Informatics Problems
Author for correspondence.
Email: zvzaharova@mail.ru
Russian Federation, Moscow, 119991; Moscow, 119333
А. А. Fisak
Faculty of Computational Mathematics and Cybernetics
Email: zvzaharova@mail.ru
Russian Federation, Moscow, 119991
Supplementary files
