Development of a model of the service system of batch arrivals in the passengers flow of public transport
DOI:
https://doi.org/10.15587/1729-4061.2019.180562Keywords:
queuing system, urban public transport, distribution of jobs in batch arrival, distribution of the number of rejectionsAbstract
A mathematical model of the queuing system for the passenger flow of urban public transport is proposed. The resulting model differs from canonical models of queuing theory by taking into account the fundamental features of real systems. Firstly, the service process is divided into different successive service sessions. Secondly, arrival and departures are batch. Thirdly, the arrival rates vary in different service sessions. Fourthly, the laws of distribution of the number of jobs in batch arrivals for different sessions are different. Fifth, the laws of distribution of the number of batch arrivals and departures are also different.
A criterion of efficiency of the service system is developed. The criterion is based on the calculation of the probability distribution of the service system states at the input and similar distribution at the output. These distributions are determined independently for each service session, into which the entire service cycle is divided. The numerical value of the criterion is set by the ratio of the average number of service rejections to the average number of jobs in the batch arrival for the entire service cycle. It can be used to assess the efficiency of the service system at any selected time interval during the day, because the value of the proposed criterion depends on the length of the interval between sessions, determined by the number of vehicles on the route.
The resulting models adequately reflect the functioning of the system, which makes it possible to predict many different situations and evaluate the consequences of proposed solutions. Thus, it becomes possible to predict the provision of the population with public transport and determine quantitative values of efficiency of the urban public transport systemReferences
- Vel'mozhin, A. V., Gudkov, V. A., Kulikov, A. V., Serikov, A. A. (2002). Effektivnost' gorodskogo passazhirskogo obshchestvennogo transporta. Volgograd, 256.
- Venttsel', E. S. (2005). Teoriya veroyatnostey. Moscow: Vysshaya shkola, 576.
- Glurman, V. E. (2006). Teoriya veroyatnostey i matematicheskaya statistika. Moscow: Vysshaya shkola, 404.
- Borovkov, A. A. (1986). Teoriya veroyatnostey. Moscow: Nauka, 386.
- Kramer, G. (1975). Matematicheskie metody statistiki. Moscow: Mir, 638.
- Borovkov, A. A. (1984). Matematicheskaya statistika. Moscow: Nauka, 472.
- Matveev, V. F., Ushakov, V. G. (1984). Sistemy massovogo obsluzhivaniya. Moscow: MGU, 240.
- Kleynrok, L. (1979). Teoriya massovogo obsluzhivaniya. Moscow: Mashinostroenie, 432.
- Afanas'eva, L. G., Rudenko, I. V. (2012). G|G|∞ queues and their applications to the transport models analysis. Theory of Probability and its Applications, 57 (3), 375–395. doi: https://doi.org/10.4213/tvp4460
- Monsik, V. B., Skrynnikov, A. A., Fedotov, A. Y. (2010). Queuing system with group service of nonordinary flow of demands. Nauchniy vestnik Moskovskogo gosudarstvennogo tehnicheskogo universiteta grazhdanskoy aviatsii, 157, 42–50.
- Monsik, V. B., Skrynnikov, A. A., Fedotov, A. J. (2012). Multichannel queuing system indivisible group of applications with a queue of unlimited length. Nauchniy vestnik Moskovskogo gosudarstvennogo tehnicheskogo universiteta grazhdanskoy aviatsii, 184, 108–112.
- Banik, A. D. (2015). Single server queues with a batch Markovian arrival process and bulk renewal or non-renewal service. Journal of Systems Science and Systems Engineering, 24 (3), 337–363. doi: https://doi.org/10.1007/s11518-015-5268-y
- Sharma, R. (2014). Mathematical Analysis of Queue with Phase Service: An Overview. Advances in Operations Research, 2014, 1–19. doi: https://doi.org/10.1155/2014/240926
- Daw, A., Pender, J. (2019). On the distributions of infinite server queues with batch arrivals. Queueing Systems, 91 (3-4), 367–401. doi: https://doi.org/10.1007/s11134-019-09603-4
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2019 Lev Raskin, Oksana Sira
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
