Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/822
Title: New analytic solutions of queueing system for shared-short lanes at unsignalized intersections
Authors: Tanackov, Ilija 
Dragić, Đorđe 
Sremac, Siniša 
Bogdanović, Vuk
Matić, Bojan 
Milojević M.
Issue Date: 1-Jan-2019
Journal: Symmetry
Abstract: © 2019 by the authors. Designing the crossroads capacity is a prerequisite for achieving a high level of service with the same sustainability in stochastic traffic flow. Also, modeling of crossroad capacity can influence on balancing (symmetry) of traffic flow. Loss of priority in a left turn and optimal dimensioning of shared-short line is one of the permanent problems at intersections. A shared-short lane for taking a left turn from a priority direction at unsignalized intersections with a homogenous traffic flow and heterogeneous demands is a two-phase queueing system requiring a first in-first out (FIFO) service discipline and single-server service facility. The first phase (short lane) of the system is the queueing system M(pλ)/M(μ)/1/∞, whereas the second phase (shared lane) is a system with a binomial distribution service. In this research, we explicitly derive the probability of the state of a queueing system with a short lane of a finite capacity for taking a left turn and shared lane of infinite capacity. The presented formulas are under the presumption that the system is Markovian, i.e., the vehicle arrivals in both the minor and major streams are distributed according to the Poisson law, and that the service of the vehicles is exponentially distributed. Complex recursive operations in the two-phase queueing system are explained and solved in manuscript.
URI: https://open.uns.ac.rs/handle/123456789/822
DOI: 10.3390/sym11010055
Appears in Collections:FTN Publikacije/Publications

Show full item record

SCOPUSTM   
Citations

5
checked on Nov 20, 2023

Page view(s)

20
Last Week
11
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.