Search

Traffic congestion is a major concern in urban centers, as it can affect society, the environment, and the economy. There are many studies on the use of computational intelligence (CI) to improve mobility in urban centers. Some of these researches focus on developing strategies for traffic light programming, since traffic coordination is complex due to its many parameters, variables, and dynamic behavior, and also an inefficient traffic control plan can lead to increased delays and contribute to traffic congestion. Although there are many works in the literature on strategies for traffic control, there are still some contributions and gaps to be filled, especially because some studies do not consider the automatic optimization of traffic signals in real time, that is, according to the demand of vehicles on the roads, considering multiple objectives and the use of a network of intersections in their experiments. In addition, some of the proposed models are not independent of simulation to evaluate the solutions of CI algorithms, resulting in a more complex deployment in real situations. In this context, this paper presents a new method to optimize traffic light plan in a network of intersections and in real time, called Active Control of Traffic Signals (ACTS) associated with the Non-Dominated Sorting Genetic Algorithm, considering multiple objectives in the optimization process (minimizing the average delay time and the number of vehicles stops per cycle). To test the applicability of the model, a real dataset of vehicle demand collected by the Company of Transport and Traffic of Belo Horizonte (BHTrans) is loaded into the AIMSUN simulator, then the method is applied and compared with the current traffic control plan used by BHTrans. The results show that the ACTS method reduces the average vehicle delay by almost half compared to the results obtained with the current solution used by BHTrans. In real life, this means less time spent in traffic, which promotes faster traffic flow, reducing traffic congestions. [ABSTRACT FROM AUTHOR]

Intelligent traffic light control (ITLC) algorithms are very efficient for relieving traffic congestion. Recently, many decentralized multi-agent traffic light control algorithms are proposed. These researches mainly focus on improving reinforcement learning method and coordination method. But, as all the agents need to communicate while coordinating with each other, the communication details should be improved as well. To guarantee communication effectiveness, two aspect should be considered. Firstly, a traffic condition description method need to be designed. By using this method, traffic condition can be described simply and clearly. Secondly, synchronization should be considered. As different intersections have different cycle lengths and message sending event happens at the end of each traffic signal cycle, every agent will receive messages of other agents at different time. So it is hard for an agent to decide which message is the latest one and the most valuable. Apart from communication details, reinforcement learning algorithm used for traffic signal timing should also be improved. In the traditional reinforcement learning based ITLC algorithms, either queue length of congested cars or waiting time of these cars is considered while calculating reward value. But, both of them are very important. So a new reward calculation method is needed. To solve all these problems, in this paper, a new ITLC algorithm is proposed. To improve communication efficiency, this algorithm adopts a new message sending and processing method. Besides, to measure traffic congestion in a more reasonable way, a new reward calculation method is proposed and used. This method takes both waiting time and queue length into consideration. [ABSTRACT FROM AUTHOR]

Traffic lights are an important controlling factor in traffic flows, and good policies will facilitate traffic congestion. A car's waiting time is highly related to the period in which the traffic lights are green or red; thus, a proper controlling policy reduces the waiting time and speeds up the car movement. Emergency vehicles always have a higher priority than other cars and need to reach their destination faster. In the last decade, a lot of research has been done to solve the traffic light scheduling issue using artificial intelligence techniques. Reinforcement learning with simulating human learning has the outstanding performance to solve complex problems, such as traffic lights control. In this study, a deep reinforcement learning traffic light control was implemented at a crossroad using real-time traffic information with an emphasis on emergency vehicles. The agent learns to adjust its policies to prioritize the emergency cars over the other cars. The results show less waiting time and speed up the cars' movement. It also indicates the emergency vehicles will cross the intersection with the least delay. With 200 to 600 cars and one emergency vehicle, the average delay decreases 2–16% in total using reinforcement learning. Considering more emergency vehicles, there is a 27–40% decrease in average delay for emergency vehicles. [ABSTRACT FROM AUTHOR]

Traffic congestion and smog are hot topics in recent years. This study analyzes the impacts of road traffic characteristic parameters on urban air quality quantitatively based on aerosol optical thickness (AOD) and geographical weighted regression (GWR) models, including the road network density, road area occupancy, intersection number, and bus network density as main factors. There are some major research findings. Firstly, there exists a strong positive correlation between the peak congestion delay index (PCDI) and air quality, the correlation has R2 values of up to 0.4962 (R 0.70). Secondly, GWR refines the local spatial changes in the AOD and the road parameters, and the correlation R2 based GWR model all above 0.6. The correlation between AOD and the road area occupancy was the highest, and the correlations with the bus network density and the intersections number were higher than that with the road network density. Thus, bus route planning, bus emission reduction, road network planning, and signal timing (at intersections) have a greater impact on air quality than other policy, especially in areas with traffic jams. The results of this study could provide theoretical support for traffic planning and traffic control, and is promising in practice. [ABSTRACT FROM AUTHOR]

As the global economy develops rapidly, traffic congestion has become a major problem for first-tier cities in various countries. In order to address the problem of failed real-time control of the traffic flow data by the traditional traffic light control as well as malicious attack and other security problems faced by the intelligent traffic light (ITL) control system, a multi-agent distributed ITL control method was proposed based on the fog computing platform and the Q learning algorithm used for the reinforcement learning in this study, and the simulation comparison was conducted by using the simulation platform jointly constructed based on the VISSIM-Excel VBA-MATLAB software. Subsequently, on the basis of puzzle difficulty of the computational Diffie–Helleman (CDH) and Hash Collision, the applicable security control scheme of ITL under the fog computing was proposed. The results reveal that the proposed intelligent control system prolongs the time of green light properly when the number of vehicles increases, thereby reducing the delay time and retention rate of vehicles; the security control scheme of ITL based on the puzzle of CDH is less efficient when the vehicle density increases, while that based on the puzzle of Hash collision is very friendly to the fog equipment. In conclusion, the proposed control method of ITL based on the fog computing and Q learning algorithm can alleviate the traffic congestion effectively, so the proposed method has high security. [ABSTRACT FROM AUTHOR]

In recent years, due to the drastic rise in the number of vehicles and the lack of sufficient infrastructure, traffic jams, air pollution, and fuel consumption have increased in cities. The optimization of timing for traffic lights is one of the solutions for the mentioned problems. Many methods have been introduced to deal with these problems, including reinforcement learning. Although a great number of learning-based methods have been used in traffic signal control, they suffer from poor performance and slow learning convergence. In this paper, a transfer learning-based method for traffic signal control has been proposed. Multi-agent system has also been used for modelling the traffic network and transfer learning has been used to make reinforcement learning agents transfer their experience to each other. Furthermore, a classifier has been utilized to classify the transferred experiences. The results show that using the proposed method leads to a significant improvement on average delay time and convergence time of the learning process. [ABSTRACT FROM AUTHOR]

Roundabouts are a form of circular intersections adopted to secure road safety of the vehicles. However, collisions are not prevented entirely even when using roundabouts, since accidents may happen at specific intersection points leading to either traffic congestions or serious accidents. In this paper, a visible light communication (VLC)-based collision avoidance scheme is proposed to coordinate autonomous vehicles in traversing roundabouts, which has high effectiveness in vehicular environments. In particular, roadside units (RSUs) are deployed at the roundabout entrances to coordinate the vehicles in a vehicle-to-infrastructure (V2I) mode. By adopting the synchronization approach, vehicles can pass the roundabout simultaneously if their paths are concurrent with each other. Otherwise, vehicles are prioritized according to their arrival time and reasonable decelerations are applied to waive potential conflicts. Simulation results showed that our proposed approach satisfies the roundabout traffic demands in terms of concurrency, safety, and time utilization as vehicles are strongly recommended to decelerate in only 22% of the cases studied in different scenarios. [ABSTRACT FROM AUTHOR]

In recent years, the number of motor vehicles in the country has risen rapidly. Traffic demand has continued to grow, while land resources, capital and energy have become increasingly tense. The development trend of urban transport system is not optimistic. Especially in the face of major events, vehicle evacuation suddenly increased, which is a serious planning for the evacuation of a serious challenge. Reasonable and accurate implementation of the emergency evacuation plan is to make the evacuation time at least, to minimize the major traffic congestion protection. Among them, route selection and traffic flow distribution are the core contents of emergency evacuation plan. In this paper, traffic emergency evacuation of major activities is taken as the research object, and the state vector of each road is introduced into the navigation system according to the linking analysis algorithm thought. The network model of evacuation route selection is established by using the theory of spatial diversity and the theory of minimum cost maximum flow, and an empirical analysis is made on the road network. Based on the research, the emergency evacuation plan for large-scale activities is proposed, and the theory and method system of emergency evacuation are enriched, which can help with formulating more reasonable and effective traffic management policies according to the characteristics of emergency evacuation, meanwhile we provide decision-making basis for urban emergency evacuation transportation planning and management. An experimental evaluation is also conducted with the real data from city of Beijing, in aspects of effectiveness and efficacy. [ABSTRACT FROM AUTHOR]

Purpose: Freight vehicle parking facilities at large urban freight traffic generators, such as urban retail malls, are often characterized by a high volume of vehicle arrivals and a poor parking supply infrastructure. Recurrent congestion of freight parking facilities generates environmental (e.g. pollution), economic (e.g. delays in deliveries) and social (e.g. traffic) negative externalities. Solutions aimed at either improving or better managing the existing parking infrastructure rely heavily on data and data-driven models to predict their impact and guide their implementation. In the current work, we provide a quantitative study of the parking supply and freight vehicle drivers' parking behaviour at urban retail malls. Methods: We use as case studies two typical urban retail malls located in Singapore, and collect detailed data on freight vehicles delivering or picking up goods at these malls. Insights from this data collection effort are relayed as data stories. We first describe the parking facility at a mall as a queueing system, where freight vehicles are the agents and their decisions are the parking location choice and the parking duration. Results: Using the data collected, we analyse (i) the arrival rates of vehicles at the observed malls, (ii) the empirical distribution of parking durations at the loading bays, (iii) the factors that influence the parking duration, (iv) the empirical distribution of waiting times spent by freight vehicle queueing to access the loading bay, and (v) the driver parking location choices and how this choice is influenced by system congestion. Conclusions: This characterisation of freight driver behaviour and parking facility system performance enables one to understand current challenges, and begin to explore the feasibility of freight parking and loading bay management solutions. [ABSTRACT FROM AUTHOR]

Purpose: Road traffic incidents cause delay, affect public safety and the environment. The CEDR PRIMA project aims to extend practical guidance for traffic managers in pro-active Traffic Incident Management (TIM) techniques to reduce the impacts and associated costs of incidents. Methods: The paper describes modelling methods used in the project for assessing the effect of different management techniques on incident duration and travel delay under various scenarios, including collision, adverse weather, heavy vehicle breakdown and other obstruction, assuming various management strategies and generic impacts of novel technologies. Macroscopic simulations of 178 variations of 13 basic scenarios have been performed using a flexible and computationally efficient macroscopic queue model, results being verified by simulation using a velocity-based Cell Transmission Model (CTM-v). Results: The results of the two modelling methods are broadly consistent. While delays estimated by the two methods can differ by up to 20%, this is small compared to the factor of 30 range of modelled delays caused by incidents, depending on their nature and circumstances, and is not sufficient to affect general conclusions. Under the peak traffic conditions assumed, the most important factor affecting delay is whether running lanes can be kept open, but quick clearance of carriageway is not always feasible. Conclusions: Comparison of two very different modelling methods confirms their consistency within the context of highly scenario-dependent results, giving confidence in the results. Future research and data needs include further validation of the models, potential application to traffic flow and conflict prediction and incident prevention, and more complete and consistent recording of incident timelines and impacts. [ABSTRACT FROM AUTHOR]

Wireless network sensors and their use in traffic monitoring, traffic density determination or vehicle speed detection and classification have recently been the focus of interest for researchers. This article describes how a new sensor circuit was designed to deliver instantaneous, real-time and novel solutions as a vehicle detection system, which is more powerful than the nodes used in other studies, and gives results with smaller error margins due to its serial communication qualification. With the proposed logic algorithm, it was possible to categorise the instantaneous traffic status of a road in four levels: no traffic, mild traffic, heavy traffic and very heavy traffic. Additionally, with the nodes placed at the beginning and the end of the road, the number of vehicles per hour for a day was determined and traffic was analysed. Then, vehicles passing by were classified with a proposed classification algorithm and magnetic signature length (MSL) parameter as cars, minibuses, buses and trucks, and an accuracy rate of 95% was obtained. As the last application, the direction of motion of the vehicle on the x-axis as well as left-to-right or right-to-left directions was determined, and the result was 94% accurate. The simplicity of the proposed algorithms, the absence of any complex mathematical calculations, the low cost of the sensor node and circuit and the low power consumption of the communication system demonstrate the superiority of this system in comparison with other studies. [ABSTRACT FROM AUTHOR]

Congestion avoidance mechanisms are used to prevent the saturation of the gateway which represents a bottleneck of the system. Recently, a new method for the congestion avoidance has been proposed: the smart access point with limited advertised window (SAP-LAW). The main idea is to hijack at the gateway the acknowledge packets in the transmission control protocol (TCP) connections in order to artificially reduce the advertised destination window according to some bandwidth allocation policy. Therefore, the flux control mechanism is artificially exploited to control the congestion at the bottleneck. The advantage of this approach is that it does not drop any packet and does not require any modification in the TCP implementations at the clients. While the most popular congestion avoidance mechanisms are the explicit congestion notification (ECN) and the random early detection (RED). In this paper, we propose stochastic models for the ECN/RED and SAP-LAW mechanisms in order to compare their performances under different scenarios. The models are studied in mean field regime, i.e. under a great number of TCP connections and UDP-based transmissions. Different from previous work for the ECN/RED, in this paper, we consider the presence of UDP traffic with bursts and the case of not greedy TCP connections. The models for SAP-LAW are totally new. The comparison is performed in terms of different performance indices including average queue length, system throughput, and expected waiting time. [ABSTRACT FROM AUTHOR]

Route planning and recommendation have received significant attention in recent years. In this light, we study a novel problem of planning unobstructed paths in traffic-aware spatial networks (TAUP queries) to avoid potential traffic congestions. We propose two probabilistic TAUP queries: (1) a time-threshold query like 'what is the path from the check-in desk to the flight SK 1217 with the minimum congestion probability to take at most 45 minutes?', and (2) a probability-threshold query like 'what is the fastest path from the check-in desk to the flight SK 1217 whose congestion probability is less than 20 %?'. These queries are mainly motivated by indoor space applications, but are also applicable in outdoor spaces. We believe that these queries are useful in some popular applications, such as planning unobstructed paths for VIP bags in airports and planning convenient routes for travelers. The TAUP queries are challenged by two difficulties: (1) how to model the traffic awareness in spatial networks practically, and (2) how to compute the TAUP queries efficiently under different query settings. To overcome these challenges, we construct a traffic-aware spatial network G( V, E) by analyzing uncertain trajectories of moving objects. Based on G( V, E), two efficient algorithms are developed to compute the TAUP queries. The performances of TAUP queries are verified by extensive experiments on real and synthetic spatial data. [ABSTRACT FROM AUTHOR]

Evacuations are massive operations that create heavy travel demand on road networks some of which are experiencing major congestions even with regular traffic demand. Congestion in traffic networks during evacuations, can be eased either by supply or demand management actions. This study focuses on modeling demand management strategies of optimal departure time, optimal destination choice and optimal zone evacuation scheduling (also known as staggered evacuation) under a given fixed evacuation time assumption. The analytical models are developed for a system optimal dynamic traffic assignment problem, so that their characteristics can be studied to produce insights to be used for large-scale solution algorithms. While the first two strategies were represented in a linear programming (LP) model, evacuation zone scheduling problem inevitable included integers and resulted in a mixed integer LP (MILP) one. The dual of the LP produced an optimal assignment principle, and the nature of the MILP formulations revealed clues about more efficient heuristics. The discussed properties of the models are also supported via numerical results from a hypothetical network example. [ABSTRACT FROM AUTHOR]

We present a microscopic model for the dynamics of a transportation flow based on cellular automata with improved lane changing rules. With this model, we study the influence of crossing transportation flows on the throughput of a multilane highway. For a two-lane highway with an exit, we obtain space-time density diagrams for different distributions of exiting cars along the lanes. Our results indicate how important traffic control is for the throughput of automobile roads. [ABSTRACT FROM AUTHOR]

Background: The intersection traffic signal control problem (ITSCP) has become even more important as traffic congestion has been more intractable. The ITSCP seeks an efficient schedule for traffic signal settings at intersections with the goal of maximizing traffic flow while considering various factors such as real-time strategies, signal timing constraints, rapid developments in traffic systems, and practical implementation. Since the factors constituting the ITSCP exhibit stochastically complicated interactions, it is essential to identify these factors to propose solution methods that can address this complexity and still be practically implemented. Objective: The objective of this review is to provide a survey of problems, methods, and practices in the evaluation of the ITSCP. In this paper, a unified terminology for the ITSCP and a citation network of the current body of relevant research are accordingly presented, and various assumptions, constraints, and solution approaches are summarized. A review across the entire body of knowledge throughout the history of the ITSCP is therefore provided. This review also highlights open issues and challenges that remain to be addressed by future research. [ABSTRACT FROM AUTHOR]

This paper studies the rate control algorithm to improve the performance of semi-TCP, which adopts a buffer-based hop-by-hop congestion control mechanism. By analyzing the impact of the buffer-based sending strategy on the medium contention and interference, we find that this sending strategy is too aggressive to increase the throughput, which leads to severe contention and interference in the channel. Extensive simulations are then carried out and reveal the significance of the channel status of the first hop in rate control. Based on the findings in the simulations, we propose a binary search-based rate control to improve semi-TCP using only local information. The proposed rate control relies on the media status in the first hop to adjust the source rate to approach the peak throughput, without the assistance of end-to-end feedback. Simulation results show the effectiveness of the proposed algorithm in improving the end-to-end throughput and delay. [ABSTRACT FROM AUTHOR]