Traffic Regulation Schemes Research Articles

Network-Level Hierarchical Bottleneck Congestion Control Method for a Mixed Traffic Network

Due to the escalating transportation demand and the significant ramifications of traffic congestion, there is an imperative to investigate the sources of congestion, known as “congestion bottlenecks”. The implementation of control methods ahead of the occurrence of congestion is crucial. Connected and autonomous vehicles (CAVs) have a high potential within the field of traffic control. CAVs are exceptionally controllable and facilitate management feasibility. This study utilizes the high compliance of CAVs to provide an effective solution for the congestion management problem at the network level when mixed traffic flows are saturated. A linear programming model to reduce average travel time over the road network is developed. By utilizing a genetic algorithm, the optimal traffic demand regulation scheme can be obtained and the departure time of CAVs optimized. The effectiveness of the proposed method is validated through simulation across various road network scales, CAVs penetration rates, and controlled CAV proportions. The proposed method can only control a specific amount of CAVs, which, according to an analysis of the simulation results, significantly improves the performance of the transportation system. The importance of employing advanced control methods to improve the sustainability of urban transportation development and the travel experience is underscored in the conclusion.

APPLICATION OF THE GRAPH-ANALYTIC APPROACH IN THE DESIGN OF TRAFFIC LIGHT CONTROL SCHEMES ON URBAN ROAD SECTIONS

Statement of the problem. The applied scheme of the organization of traffic light regulation of urban traffic is one of the key factors determining the convenience and environmental friendliness of the functioning of the entire transport infrastructure of the city. Optimization of its parameters is the simplest and most cost-effective way to increase the comfort of moving along urban highways and improve the overall environmental situation. Results. The use of a graphical large-scale traffic flow diagram as a simple and convenient tool for analyzing and optimizing the traffic light regulation scheme on the section of the dominant highway of the road network is considered. As an example, an optimized version of the traffic light regulation scheme on Raboche-Krestyanskaya Street in the city of Volgograd is shown. Conclusions. The proposed graph-analytic approach allows one to quickly and visually develop, analyze, and, if necessary, optimize the parameters of the traffic light control scheme on problematic sections of urban highways.

Energy-Efficient Traffic Regulation and Scheduling for Video Streaming Services Over LTE-A Networks

To reduce power consumption of smartphones, this work proposes a novel discontinuous reception (DRX)-based power saving mechanism for LTE-A networks supporting multi-services. The novel designs of the proposed mechanism mainly include the highest priority-controlled DRX (HPC-DRX) and traffic regulation plus time slicing (TRTS) schemes. In our proposed HPC-DRX/TRTS, lower priority traffic never wakes user equipments (UEs) up and all incoming traffic for UEs is temporarily buffered at the evolved Node B (eNB) and then transmitted in bursts using the overall bandwidth, yielding much better power saving performance. To support multiple users with multi-services, this paper proposes the resource allocation and burst scheduling algorithms for the HPC-DRX/TRTS. The power saving ratios of the proposed mechanisms were theoretically analyzed based on an M/G/1 busy period model. Both the percentage of sleep period and actual power consumption model were used in calculating the power saving ratio. Numerical results show that our analytical results are accurate and the proposed HPC-DRX/TRTS significantly outperforms the conventional DRX, dynamic and adjustable DRX (DADRX), and coalesced DRX in terms of power saving ratio. In addition to significantly reducing power consumption of UEs with video streaming services and diverse data applications (DDA), the proposed HPC-DRX/TRTS preserves the video playout quality at UEs as well.

Comparison of hook-turn scheme with U-turn scheme based on actuated traffic control algorithm

This paper addresses an innovative traffic regulation scheme at signalised intersection, termed as the Hook-turn (HT) scheme, and contrasts its performance with the classic U-turn (UT) scheme. The HT relocates the right-turning vehicles (in the countries where driving is on the left) from the far-side lane to the curbside lane, requires them to dwell at the intersection, and eventually leave during the green time of the side road. This paper comprehensively compares the performance of these two schemes based on VISSIM simulations, in terms of three different performance measures (Average Delay, Average Travel Time, and Number of vehicles crossing the network per hour (NVPH)). An Actuated Control Algorithm is proposed to dynamically adjust the traffic signal plans under 48 different scenarios. The simulation results can be summarised as: (1) in all the scenarios, UT can outperform HT, in terms of the Average Travel Delay of through vehicles, left-turning vehicles and trams; (2) when the intersection is oversaturated, the Average Travel Delay of right-turning vehicles under UT is higher than that of HT; (3) The Average Travel Time of right-turning vehicles under the HT scheme is evidently shorter than that of UT; (4) the UT scheme yields higher NVPH to the right-turning vehicles; yet; the HT scheme gives rise to higher NVPH to the through vehicles.

Max-min utility fair flow management for networks with route diversity

A regional central manager is employed to set aside, for the regional (or back-bone) network that it manages, for each flow class, communications capacity resources for a specific future time horizon. In the context of such a traffic management operation, a longer temporal scale is involved in controlling the admission and distribution of flows across the network. For management scal-ability purposes, flows are aggregated into flow classes. Furthermore, we consider a network operation under which multiple simultaneously activated routes are employed, across possibly distinct segments, to distribute traffic between identified source-destination pairs. We aim to ensure that the utility assigned to each class is as high as feasibly possible while striving to raise the utility gained by all classes in a maxmin fair manner. In doing so, we incorporate the communications capacity constraints that are imposed by the underlying hybrid of directional and/or multiple-access wireline and wireless communications media employed across the network system. We develop and present in this paper an optimal algorithm for solving such a traffic management problem. It yields multi-utility-based max-min fair distributions of flow rates, per each class, across the specified multitude of simultaneously activated multi-segment routes. To guarantee that admitted flows are granted their desired capacity resources (and targeted corresponding utility levels), the selection of optimal flow distributions across the network routes is combined with the use of a flow admission control scheme that serves to optimally limit the aggregate rate of flows admitted for each flow class. As illustrative examples, we demonstrate the effectiveness of our solution in comparing its performance with that obtained under the use of a traffic regulation scheme that is not overlaid with a traffic management mechanism that serves to set aside resources for the support of flow classes. We also illustrate the use of our optimal algorithm for determining the optimal placement of unmanned aerial vehicle platforms that serve to supplement a terrestrial transport segment with a space-based one.

Some optimal traffic regulation schemes for ATM networks: a Markov decision approach

Some new traffic regulation schemes are defined in terms of a relief-spacing (or spacing of the allowance for cell delivery to the network) function. The class of open-loop traffic regulators (TR's) is defined in terms of relief-spacing functions which depend on some user-state; this class may be viewed as an extension of the Spacer-Controller defined in terms of some constant (user-state independent) relief-function. The optimal open-loop TR's are derived by formulating proper optimization problems and applying a Markov decision approach. Numerical results illustrate the improved performance of the optimal open-loop TR over that of the (constant relief-spacing) Spacer-Controller. Finally, the class of closed-loop TR's is defined in terms of relief-spacing functions which depend on both some user- and some network-state information and its optimal element is derived. The improved performance under the optimal closed-loop TR over that of the optimal open-loop TR is illustrated and their difference determines the performance gain if feedback information can become available on time.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

A Shipower's View of Traffic Regulation

Many may consider it presumptuous of the guinea-pig to voice an opinion on the experiment to which he is to be subjected. I hope this is not so, because I view the shipowner not as the guinea-pig but as the prospective customer for any advances which are made in marine traffic engineering technology. The shipowners of the world are undoubtedly going to pay directly or indirectly for any traffic regulation schemes which are set up. It is certainly not part of my theme that the customer is always right—he may not know what he wants until he has been subjected to a promotional advertising campaign and he may be excessively gullible in swallowing such propaganda—but there is possibly value in the customer saying what he thinks he wants and airing doubts he may have before he is subjected to these pressures. I therefore welcome the opportunity to give a shipowner's view on traffic regulation.