Search

Traffic congestion has several adverse effects on urban traffic networks. Increased travel times of vehicles, with the addition of excessive greenhouse emissions, can be listed as harmful effects. To address these issues, transportation engineers aim to reduce private car usage, reduce travel times through different control strategies, and mitigate harmful effects on urban networks. In this study, we introduce an innovative approach to optimizing traffic signal control settings. This methodology takes into account both pedestrian delays and vehicular emissions. Non-dominated sorting genetic algorithm-II and Multi-objective Artificial Bee Colony algorithms are adopted to solve the multi-objective optimization problem. The vehicular emissions are modeled through the MOVES3 emission model and integrated into the utilized microsimulation environment. Initially, the proposed framework is tested on a hypothetical test network, followed by a real-world case study. Results indicate a significant improvement in pedestrian delays and lower emissions. [ABSTRACT FROM AUTHOR]

Traffic congestion is a serious problem in the US, and traffic signal control is one of the effective solutions to congestion. Previous research on model predictive control (MPC)-based traffic signal control showed substantial benefits over conventional methods. This study focused on implementing MPC over a large-scale network with complex intersections and the impact of cycle length, network size, and imperfect state estimation on performances. This study implemented a virtual phase link (VPL)-based model predictive control method which used the number of vehicles in each VPL as input state variables and was suitable for National Electrical Manufacturing Association (NEMA) ring-barrier control. To test the impact of network size, the performance of distributed MPC (36 intersections in the network are divided into five subnetworks) was compared with that of MPC over the full network for a set of cycle lengths. To test the impact of imperfect state estimation, we synthetically infused estimation error and developed two scenarios, MPC-error and MPC-error narrow, which had higher and lower estimation errors, respectively. The performance of these MPC methods was compared with that of the existing time-of-day (TOD) method and an offline method that used Webster's method for split and MULTIBAND for cycle length and offset optimization. Trajectory and linkwise signal performance measures were collected from the simulation to evaluate performance. The distributed MPC method with perfect state estimation had the lowest delay and highest energy efficiency of all the methods. The performance of MPC decreased as the prediction inaccuracy increased. MPC-error had 7% and 11% more delay than MPC-error narrow in the morning and evening peaks, respectively. Overall, simulation results suggest that even with imperfect state estimation, MPC methods will outperform offline methods significantly. [ABSTRACT FROM AUTHOR]

Recent advancements in the industrial revolution and artificial intelligence have aided in the development of novel approaches that have considerable potential for increasing the efficiency of traffic networks. Emerging concepts of autonomous driving and machine learning can be incorporated intelligently for improving traffic operations and control. In the coming years, traffic composition can vary in terms of autonomous vehicle (AV) penetration rate, which can lead to a heterogeneous traffic environment. Traffic control methods for such complex networks need to be designed effectively for accommodating the positive effects of AV implementation without compromising the safety and level of service in the presence of regular vehicles (RVs). An intelligent-based optimization framework for traffic signal control under heterogeneous AV-based traffic is proposed in this paper. This framework utilizes state-of-the-art machine-learning approaches to represent and design different components of the optimization process of cycle length. Further, SHapley Additive exPlanations (SHAP) is used to enhance model interpretability. The proposed optimization framework improves performance under congested traffic conditions compared with that of the conventional optimization methods. Compared to pure RV-based traffic, the penetration rates of 25%, 50%, and 100% can decrease optimized cycle lengths by 26%, 39%, and 53%, respectively, which can result in delay reductions of approximately 18%, 31%, and 56%, respectively. The proposed framework when applied in an adaptive-based manner can help in the generalization of controlling existing signalized intersections with the gradual penetration of AVs without the extra infrastructure or specific operational and connectivity capabilities of the involved vehicles. [ABSTRACT FROM AUTHOR]

Under the context of rapid development of the Internet of vehicles and vehicle-road collaboration system, active traffic management (ATM) becoming the mainstream means of road traffic control and developing toward refinement. In this paper, to study the high-precision lane-level dynamic induction control strategy in different scenarios, based on the NaSch model of cellular automata and combined with the characteristics of the failure section area, a fuzzy lane-changing bypass vehicle-following model considering lane-changing pressure in multi-lane failure scenarios was built. The simulation results show that (i) if the lane failure occurs on the middle lane, the lane should be induced in advance, and the induced lane change effect is the best at about 100 m. When the lane failure occurs in the left lane and right lane, the prompt is best at about 250 m. (ii) The induced distance should be based on actual traffic conditions, free combination of different early warning distances between 100 and 300 m can save about 20–30 s congestion time. (iii) The lane-level dynamic coordinated guidance control measures can effectively improve the road traffic efficiency compared with the static unified control measures, improve the traffic efficiency of road performance, and alleviate traffic congestion time. The conclusion of this paper can provide some reference for dynamic active control management and achieve higher accuracy of traffic flow lane-level control. [ABSTRACT FROM AUTHOR]

The current traffic signal light timing scheme cannot effectively solve the problem of traffic congestion. This paper studied the intelligent control of signal lights based on infrared sensors. Firstly, the traffic flow was detected by infrared sensors; then, the future traffic flow was predicted using a back-propagation neural network; an intelligent control algorithm was designed based on the prediction results, and data were collected at the actual intersection for simulation experiments. It was found that the maximum and minimum root-mean-square error (RMSE) value of the BPNN prediction were 72.33 and 45.77, respectively, i.e., BPNN could predict the traffic flow accurately. Then, in the comparison of timing schemes, the maximum average queuing delay time of the BPNN was 0.55 s, and the maximum average queuing length was 92 m in the case of large traffic flow, both of which were better than the traditional fixed timing scheme. The results prove the reliability of the proposed signal light intelligent control algorithm. The algorithm can be further applied in practice. [ABSTRACT FROM AUTHOR]

This paper proposes a convolutional neural network (CNN) model of the signal distribution control algorithm (SDCA) to maximize the dynamic vehicular traffic signal flow for each junction phase. The aim of the proposed algorithm is to determine the reward value and new state. It deconstructs the routing components of the current multi-directional queuing system (MDQS) architecture to identify optimal policies for every traffic scenario. Initially, the state value is divided into a function value and a parameter value. Combining these two scenarios updates the resulting optimized state value. Ultimately, an analogous criterion is developed for the current dataset. Next, the error or loss value for the present scenario is computed. Furthermore, utilizing the Deep Q-learning methodology with a quad agent enhances previous study discoveries. The recommended method outperforms all other traditional approaches in effectively optimizing traffic signal timing. [ABSTRACT FROM AUTHOR]

In this work, the connected vehicle's messages are used to create an enhanced adaptive traffic signal control (ATSC) system for improved traffic flow. Few existing studies use connected and automated vehicles (CAVs) to develop traffic signal control algorithms under hybrid connected and autonomous conditions. The proposed approach focuses on a four‐phase traffic intersection with both CAVs and human‐driven vehicles (HVs). CAVs share real‐time state information, and a model called Roads Dynamic Segmentation estimates queuing procedures and vehicle fleet numbers on dynamic road sections. This information is used in the Store and Forward Model (SFM) to predict intersection queuing length. The ATSC system, based on model predictive control (MPC), aims to minimize intersection queue length while considering traffic constraints (undersaturated, saturated, and oversaturated) and avoiding free‐flow problems due to queue overflow. To reduce computational complexity, a linear‐quadratic‐regulator (LQR) is used. Real‐world vehicle trajectories and the SUMO tool are used for experimental purposes. Results show that the proposed method reduces average delay by 38.50% and 33.42% compared to fixed timing and traditional MPC in cases of oversaturated traffic flow with 100% CAV penetration. Even with a penetration rate of only 20%, average delay decreases by 13.65% and 6.50%, respectively. This study showcases not only the potential benefits of CAV in enhancing traffic, but also enables the optimal utilization of green duration in signalized intersection control systems. This helps prevent traffic congestion and ensures the efficient and smooth movement of traffic flow. [ABSTRACT FROM AUTHOR]

In recent years, high-resolution traffic signal event data has provided valuable insights into understanding and managing congestion at signalized intersections. While existing applications primarily employ automated traffic signal performance monitoring (ATSPM) systems as postanalysis tools for identifying everyday congestion causes, traffic engineers are increasingly overwhelmed by the number of ATSPM-capable intersections. The workload increases extensively as the number of ATSPM-capable intersections rises mainly due to the necessity of manually checking and generating performance figures. Nonetheless, an advanced ATSPM system capable of automatically detecting time-of-day congestion bottlenecks among multiple intersections and suggesting "top intersections of interest" would significantly aid traffic managers in monitoring historical congestion and preventing future congestion occurrences. This paper introduces an efficient graphical automated congestion ranking method for capable intersections, leveraging high-resolution traffic signal event data as the basis for automated congestion ranking. To accomplish these objectives, we build upon ATSPM concepts by continuously generating ATSPM measures of effectiveness (MOEs). Utilizing continuously generated ATSPM performance measures in Frisco, Texas, over several months, we devise an efficient graphical method for ranking hourly congestion levels among the studied ATSPM-capable intersections. All intersections are assessed and ranked using a multiobjective optimization technique, the Pareto front method. The points on the Pareto front represent dominating intersections with at least one inferior performance measurement, warranting prioritized improvement. The dominating points identified from the test dataset were validated and further explained using Purdue coordination diagrams (PCD), along with another individual dataset--Wejo-connected vehicle data. The outcomes of this approach have proven the validity of the method. [ABSTRACT FROM AUTHOR]

Machine learning (ML) methods, particularly Reinforcement Learning (RL), have gained widespread attention for optimizing traffic signal control in intelligent transportation systems. However, existing ML approaches often exhibit limitations in scalability and adaptability, particularly within large traffic networks. This paper introduces an innovative solution by integrating decentralized graph-based multi-agent reinforcement learning (DGMARL) with a Digital Twin to enhance traffic signal optimization, targeting the reduction of traffic congestion and network-wide fuel consumption associated with vehicle stops and stop delays. In this approach, DGMARL agents are employed to learn traffic state patterns and make informed decisions regarding traffic signal control. The integration with a Digital Twin module further facilitates this process by simulating and replicating the real-time asymmetric traffic behaviors of a complex traffic network. The evaluation of this proposed methodology utilized PTV-Vissim, a traffic simulation software, which also serves as the simulation engine for the Digital Twin. The study focused on the Martin Luther King (MLK) Smart Corridor in Chattanooga, Tennessee, USA, by considering symmetric and asymmetric road layouts and traffic conditions. Comparative analysis against an actuated signal control baseline approach revealed significant improvements. Experiment results demonstrate a remarkable 55.38% reduction in Eco_PI, a developed performance measure capturing the cumulative impact of stops and penalized stop delays on fuel consumption, over a 24 h scenario. In a PM-peak-hour scenario, the average reduction in Eco_PI reached 38.94%, indicating the substantial improvement achieved in optimizing traffic flow and reducing fuel consumption during high-demand periods. These findings underscore the effectiveness of the integrated DGMARL and Digital Twin approach in optimizing traffic signals, contributing to a more sustainable and efficient traffic management system. [ABSTRACT FROM AUTHOR]

Urbanization has led to accelerated traffic congestion, posing a significant obstacle to urban development. Traditional traffic signal scheduling methods are often inefficient and cumbersome, resulting in unnecessary waiting times for vehicles and pedestrians, exacerbating the traffic situation. To address this issue, this article proposes a dynamic traffic signal scheduling system based on an improved greedy algorithm. Unlike conventional approaches, we introduce a reward function and a cost model to ensure fair scheduling plans. A constraint function is also established, and the traffic signal scheduling is iterated through the feasible matrix using the greedy algorithm to simplify the decision-making process and enhance solution efficiency. Moreover, an emergency module is integrated to prioritize special emergency vehicles, reducing their response time during emergencies. To validate the effectiveness of our dynamic traffic signal scheduling system, we conducted simulation experiments using the Simulation of Urban Mobility (SUMO) traffic simulation suite and the SUMO traffic control interface Traci. The results indicate that our system significantly improves intersection throughput and adapts well to various traffic conditions, effectively resolving urban traffic congestion while ensuring fair scheduling plans. [ABSTRACT FROM AUTHOR]

Traffic light optimization is known to be a cost-effective method for reducing congestion and energy consumption in urban areas without changing physical road infrastructure. However, due to the high installation and maintenance costs of vehicle detectors, most intersections are controlled by fixed-time traffic signals that are not regularly optimized. To alleviate traffic congestion at intersections, we present a large-scale traffic signal re-timing system that uses a small percentage of vehicle trajectories as the only input without reliance on any detectors. We develop the probabilistic time-space diagram, which establishes the connection between a stochastic point-queue model and vehicle trajectories under the proposed Newellian coordinates. This model enables us to reconstruct the recurrent spatial-temporal traffic state by aggregating sufficient historical data. Optimization algorithms are then developed to update traffic signal parameters for intersections with optimality gaps. A real-world citywide test of the system was conducted in Birmingham, Michigan, and demonstrated that it decreased the delay and number of stops at signalized intersections by up to 20% and 30%, respectively. This system provides a scalable, sustainable, and efficient solution to traffic light optimization and can potentially be applied to every fixed-time signalized intersection in the world. Without relying on any infrastructure-based vehicle detectors, the authors present a scalable traffic signal re-timing system that uses a small percentage of connected vehicle trajectories as the only input. Real-world tests demonstrate that the system decreases both delays and number of stops. [ABSTRACT FROM AUTHOR]

With the increasing number of urban vehicles, as well as the current situation of non-intelligent traffic control systems, spatiotemporal non-uniform traffic resource occupation, and limited traffic planning and design, existing urban traffic planning methods cannot effectively solve problems such as frequent traffic congestion and uncontrollable commuting time for residents. In order to solve the above problems, this paper first constructs a multi-queue, multi-server queuing model based on the server vacation and a multi-hop cascaded queuing model from the perspective of local intersections and global commuting paths. We analyze the theoretical changes in passage delay costs at local intersections and on global commuting paths as a function of traffic flow and the random duration of traffic signals. On this basis, this article proposes a collaborative intelligent traffic planning algorithm based on artificial intelligence, which utilizes traffic sensors to dynamically perceive traffic congestion status and collaboratively plans the optimal duration of traffic signals and the optimal driving path of vehicles from both local and global perspectives, thereby maximizing the on-time arrival ratio of vehicles while ensuring the required commuting delay. The simulation results show that the proposed method can increase the on-time arrival ratio of vehicles by at least 20% compared to contrast methods while meeting the requirements relating to commuting delays. This verifies that our method can provide support for the improvement in efficiency in future Internet of vehicles. [ABSTRACT FROM AUTHOR]

The phenomenon of traffic congestion started in the second half of the twentieth century. This arose because of our society's constant increase in demand for mobility. The excessive traffic of vehicles attempting to use the same infrastructure at the same time is what causes congestion. The consequences are well-known: delays, air pollution, reduced speed, and dissatisfaction (which may lead to risky maneuvers, reducing pedestrian and other driver safety). Our objective is to simulate the change in traffic patterns brought about by app users in residential areas (using navigational tools like Google Maps and Apple Maps), where the majority of navigational tools provide shortcuts that go through residential areas. In addition to discouraging navigation apps from directing drivers through residential areas during peak hours to mitigate pollution levels, by developing an algorithm based on the technology of Green Light Optimized Speed Advisory (GLOSA) and implementing it in a simulated environment (VISSIM), we can see the effect of changing the duration of red lights while keeping green lights constant. Overall, this solution can be implemented to change the times of traffic lights without the need for supplies, additional equipment, or warning signs because most cities' traffic lights are already remotely controlled. In addition, this procedure is temporary to provide some freedom and does not adhere to the speed specified for drivers who wish to pass through residential areas outside of rush hour. [ABSTRACT FROM AUTHOR]

This paper uses colored Petri nets (PN) to develop a model of vehicle movement in a city. The modeler defines the number and location of crossroads, the connections between them, and how many vehicles are at the given points of the network. The vehicles are recognized by their license plate numbers, and it is possible to determine where they start their journey and where they are going. The algorithm proposed in this paper suggests the shortest vehicle route based on Dijkstra's algorithm. This study focuses on improving route planning by considering road usage, which is determined by the starting and ending locations of vehicles (as if traffic cameras were identifying license plates). This approach will lead to optimal control of traffic lights (or vehicle navigation) to minimize traffic jams and make good use of all roads. Additionally, this paper shares the results of preliminary simulations using both colored and uncolored Petri nets in the GPenSIM environment. [ABSTRACT FROM AUTHOR]

• Develop a novel two-layer coordinated multi-agent reinforcement learning algorithm. • Synergize traffic signals through local cooperation and global coordination. • Optimization of vehicle emissions and traffic congestion as simultaneous goals. • Proposed method is performed in synthetic network and Cologne urban network on SUMO. Intersection traffic signal control considering vehicle emissions has become an important topic, however, the decision complexity of traffic signal control increases dramatically in a dynamic traffic environment with multi-intersections. It is a severe challenge to coordinate traffic signals at multi-intersections based on Internet of Things information to improve the traffic condition of the road network. This paper proposes a two-layer coordination algorithm based on multi-agent reinforcement learning—Multi-agent Coordinated Policy Optimization (MACoPO), for solving traffic signal control at multi-intersections. MACoPO consists of local cooperation, which adjusts the weights of individual rewards and neighborhood agents' rewards by using local cooperation factors (LCF), and global coordination, which updates the LCF to maximize global rewards. The state and reward functions are designed in terms of the current state of the signal, waiting queue length, vehicle density and emission concentration in the lane, vehicle delay, and vehicle emissions, thus making full use of the intersection state information. The proposed method is extensively assessed through simulation experiments using artificial and real road networks and the numerical results confirm its effectiveness in complex and dynamic real-time traffic environments with multi-intersections. [ABSTRACT FROM AUTHOR]