A Two-Way Arterial Signal Coordination Method With Queueing Process Considered

2015 ◽  
Vol 16 (6) ◽  
pp. 3440-3452 ◽  
Author(s):  
Bao-Lin Ye ◽  
Weimin Wu ◽  
Weijie Mao
2000 ◽  
Vol 13 (4) ◽  
pp. 415-427
Author(s):  
Lev Abolnikov ◽  
Alexander Dukhovny

A bulk M/G/1 system is considered that responds to large increases (decreases) of the queue during the service act by alternating between two service modes. The switching rule is based on two “up” and “down” thresholds for total arrivals over the service act. A necessary and sufficient condition for the ergodicity of a Markov chain embedded into the main queueing process is found. Both complex-analytic and matrix-analytic solutions are obtained for the steady-state distribution. Under the assumption of the same service time distribution in both modes, a combined complex-matrix-analytic method is introduced. The technique of “matrix unfolding” is used, which reduces the problem to a matrix iteration process with the block size much smaller than in the direct application of the matrix-analytic method.


2018 ◽  
Vol 11 (1) ◽  
pp. 1
Author(s):  
Supiyono, Dwi Ratnaningsih, Rudy Ariyanto

Abstract Highway in Malang there that needs to be analyzed is Intersections Letjend S. Parman Street – Ciliwung Street and Letjend Sutoyo Street – Letjend Selorejo. The road is an arterial road in the city of Malang with a high vehicle density level (Saputra, 2013). The Street was a high traffic flow led to queues or long saturated flow that is not supported by the settings of the light signals in accordance with the conditions in the field so often causes congestion. From finding a solution the traffic density in the study Letjend S Parman Street – Ciliwung Street and Letjend Sutoyo Street – Letjend Selorejo with Indonesia Highway Capasity Manual (IHCM). After stages 3-signal coordination calculation in Ciliwung Intersection of Malang, Intersection obtained time peak hours at the intersection area occurred at 11.00 – 12.00 GMT. Performance 3-waay junction on the Ciliwung Malang at this time has not met the target. Seen from there is still a Degree of Saturation (DS) which do not meet the targets ( ≤ 0,75), namely 0,83. After having don e engineering into 3 phases and cycle time 100 minutes Degree of Saturation (DS) be 0,77. Keywords: intersection, peak hours, capacity and degree saturation


2020 ◽  
Vol 53 (5) ◽  
pp. 609-616
Author(s):  
Ying Wang ◽  
Zongzhong Tian

This paper proposes an efficient origin-estimation bandwidth (OD band) model, which provides dedicated progression bands for arterial traffic based on the real-time dynamic matrix of their estimated OD pairs. The innovations of the OD band model are as follows: First, the dynamics of through and turning-in/out traffics are analyzed based on the matrix of their estimated OD pairs, and used to generate the traffic movement sequence at continuous intersections; Second, the end-time of green interval for lag-lag phase sequence at continuous intersections is determined according to the relevant constraints, the relationship between the start/end-time of green interval and the minimum/maximum green intervals; Third, the bandwidths of the two directions of the artery ware produced, after being weighted by their traffic demands. The intuitiveness, convenience, and feasibility of the OD band model were fully demonstrated through a case study. Overall, the OD band model helps to produce bi-directional progression bands for traffic with many turning movements on the artery, and enables the through and turning-in/out traffics to proceed through continuous intersections, when the signals at those intersections are green.


1997 ◽  
Vol 3 (3) ◽  
pp. 243-253
Author(s):  
Alexander V. Babitsky

The author studies an M/G/1 queueing system with multiple vacations. The server is turned off in accordance with the K-limited discipline, and is turned on in accordance with the T-N-hybrid policy. This is to say that the server will begin a vacation from the system if either the queue is empty orKcustomers were served during a busy period. The server idles until it finds at leastNwaiting units upon return from a vacation.Formulas for the distribution generating function and some characteristics of the queueing process are derived. An optimization problem is discussed.


Author(s):  
Muhammad Tahmidul Haq ◽  
Amirarsalan Mehrara Molan ◽  
Khaled Ksaibati

This paper aims to advance the current research on the new super diverging diamond interchange (super DDI) design by evaluating the operational efficiency using real-world locations. As part of a comprehensive research effort on improving the performance of failing service interchanges in the mountain-plains region, the study identified three interchanges (Interstate 225 and Mississippi Avenue, Interstate 25 and 120th Avenue, and Interstate 25 and Hampden Avenue) at Denver, Colorado as the potential candidates to model for future retrofit. Four interchange designs (i.e., existing CDI [conventional diamond interchange], DDI, super DDI-1, and super DDI-2) were tested in this study. The operational analysis was conducted using VISSIM and Synchro. Several microsimulation models (120 scenarios with 600 runs in total) were created with three peak hours (a.m., noon, and p.m.) for existing (the year 2020) and projected (the year 2030) traffic volumes. The study considered two simulation networks: (1) when no adjacent traffic signal exists, to determine how the four interchange designs would perform if there were no adjacent signals or they were far away from the interchange; and (2) when there are two adjacent traffic signals, to evaluate the performance of the four interchanges in a bigger corridor with signal coordination needed. An important finding is that super DDI designs outperformed DDI with adjacent signals and higher traffic demand, while DDI performed similarly to or sometimes insignificantly better than super DDI if no adjacent intersections were located in the vicinity and if the demand was lower than the DDI’s capacity.


1975 ◽  
Vol 7 (02) ◽  
pp. 416-430
Author(s):  
A. L. Truslove

For the E k /G/1 queue with finite waiting room the phase technique is used to analyse the Markov chain imbedded in the queueing process at successive instants at which customers complete service, and the distribution of the busy period, together with the number of customers who arrive, and the number of customers served, during that period, is obtained. The limit as the size of the waiting room becomes infinite is found.


2019 ◽  
Vol 24 (1) ◽  
pp. 81-92 ◽  
Author(s):  
Pangwei Wang ◽  
Yilun Jiang ◽  
Lin Xiao ◽  
Yi Zhao ◽  
Yinghong Li

Sign in / Sign up

Export Citation Format

Share Document