Search

Macroscopic traffic flow modeling is essential for describing and forecasting the characteristics of traffic flow. However, the classic Lighthill–Whitham–Richards (LWR) model only provides equilibrium values for steady‐state conditions and fails to capture common stochastic variabilities, which are a necessary component of accurate modeling of real‐time traffic management and control. In this paper, a stochastic LWR (SLWR) model that randomizes free‐flow speed is developed to account for the stochasticity incurred by the heterogeneity of drivers, while holding individual drivers' behavior constant. The SLWR model follows a conservation law of stochastic traffic density and flow and is formulated as a time‐dependent stochastic partial differential equation. The model is solved using a dynamically bi‐orthogonal (DyBO) method based on a spatial basis and stochastic basis. Various scenarios are simulated and compared with the Monte Carlo (MC) method, and the results show that the SLWR model can effectively describe dynamic traffic evolutions and reproduce some commonly observed traffic phenomena. Furthermore, the DyBO method shows significant computational advantages over the MC method. [ABSTRACT FROM AUTHOR]

With rapid development of the urbanization, how to improve the traffic lights efficiency has become an urgent issue. The traditional traffic light control is a method that calculates a series of corresponding timing parameters by optimizing the cycle length. However, fixing sequence and duration of traffic lights is inefficient for dynamic traffic flow regulation. In order to solve the above problem, this study proposes a traffic light timing optimization scheme based on deep reinforcement learning (DRL). In this scheme, the traffic lights can output an appropriate phase according to the traffic flow state of each direction at the intersection and dynamically adjust the phase length. Specifically, we first adopt Proximal Policy Optimization (PPO) to improve the convergence speed of the model. Then, we elaborate the design of state, action, and reward, with the vehicle state defined by Discrete Traffic State Encoding (DTSE) method. Finally, we conduct experiments on real traffic data via the traffic simulation platform SUMO. The results show that, compared to the traditional timing control, the proposed scheme can effectively reduce the waiting time of vehicles and queue length in various traffic flow modes. [ABSTRACT FROM AUTHOR]

The tremendous increase in vehicular navigation often witnessed daily has elicited constant and continuous traffic congestion at signalized road intersections. This study focuses on applying an artificial neural network trained by particle swarm optimization (ANN-PSO) to unravel the problem of traffic congestion. Traffic flow variables, such as the speed of vehicles on the road, number of different categories of vehicles, traffic density, time, and traffic volumes, were considered input and output variables for modelling traffic flow of non-autonomous vehicles at a signalized road intersection. Four hundred and thirty-four (434) traffic datasets, divided into thirteen (13) inputs and one (1) output, were obtained from seven roadsites connecting to the N1 Allandale interchange identified as the busiest road in Southern Africa. The results obtained from this research have shown a training and testing performance of 0.98356 and 0.98220. These results are indications of a significant positive correlation between the inputs and output variables. Optimal performance of the ANN-PSO model was achieved by tuning the number of neurons, accelerating factors, and swarm population sizes concurrently. The evidence from this research study suggests that the ANN-PSO model is an appropriate predictive model for the swift optimization of vehicular traffic flow at signalized road intersections. This research extends our knowledge of traffic flow modelling at a signalized road intersection using metaheuristics algorithms. The ANN-PSO model developed in this research will assist traffic engineers in designing traffic lights and creation of traffic rules at signalized road intersections. [ABSTRACT FROM AUTHOR]

Urban road dynamic impedance calculation is the important basis of dynamic traffic assignment and real-time traffic management and control scheme. The current impedance calculation is mostly based on BPR function, and the BPR function is derived from macroscopic statistical laws, in which the microscopic characteristics of traffic flow are insufficiently described. In order to more accurately express the change laws of traffic impedance at the microscopic level, a stochastic dynamic traffic assignment algorithm based on road impedance function is designed to analyze the time impedance of congested roads under random dynamic traffic assignment under different conditions of road network saturation. Compared with the current model, the comprehensiveness and portability are greatly improved. The results show that the impedance calculation error of this method is less than 10% when the load degree of the road is lower than 0.85, which proves that the method has good precision under unsaturated flow conditions. [ABSTRACT FROM AUTHOR]

Variable speed limit (VSL) is becoming recognized as an effective way to improve traffic throughput and road safety. In particular, methods based on traffic state prediction exhibit promising potential to prevent future traffic congestion and collisions. However, field observations indicate that the traffic state prediction model results in nonnegligible error that impacts the next step decision making of VSL. Thus, this paper investigates how to eliminate this prediction error within a VSL environment. In this study, the traffic state prediction model is a second-order traffic flow model named METANET, while the VSL control is model predictive control (MPC) based, and the VSL decision is discrete optimized choice. A simplified version of the switching mode stochastic cell transmission model (SCTM) is integrated with the METANET model to eliminate the prediction error. The performance of the proposed method is assessed using field data from a VSL pilot test in Edmonton, Canada, and is compared with the prediction results of the baseline METANET model during the road test. The results show that during the most congested period the proposed SCTM-METANET model significantly improves the prediction accuracy of regular METANET model. [ABSTRACT FROM AUTHOR]

In India, traffic flow on roads is highly mixed in nature with wide variations in the static and dynamic characteristics of vehicles. At unsignalized intersections, vehicles generally do not follow lane discipline and ignore the rules of priority. Drivers generally become more aggressive and tend to cross the uncontrolled intersections without considering the conflicting traffic. All these conditions cause a very complex traffic situation at unsignalized intersections which have a great impact on the capacity and performance of traffic intersections. A new method called additive conflict flow (ACF) method is suitable to determine the capacity of unsignalized intersections in non-lane-based mixed traffic conditions as prevailing in India. Occupation time is the key parameter for ACF method, which is defined as the time spent by a vehicle in the conflict area at the intersection. Data for this study were collected at two three-legged unsignalized intersections (one is uncontrolled and other one is semicontrolled) in Mangalore city, India using video-graphic technique during peak periods on three consecutive week days. The occupation time of vehicles at these intersections were studied and compared. The data on conflicting traffic volume and occupation time by each subject vehicle at the conflict area were extracted from the videos using image processing software. The subject vehicles were divided into three categories: two wheelers, cars, and auto-rickshaws. Mathematical relationships were developed to relate the occupation time of different categories of vehicles with the conflicting flow of vehicles for various movements at both the intersections. It was found that occupation time increases with the increasing conflicting traffic and observed to be higher at the uncontrolled intersection compared to the semicontrolled intersection. The segregated turning movements and the presence of mini roundabout at the semicontrolled intersection reduces the conflicts of vehicular movements, which ultimately reduces the occupation time. The proposed methodology will be useful to determine the occupation time for various movements at unsignalized intersections. The models developed in the study can be used by practitioners and traffic engineers to estimate the capacity of unsignalized intersections in non-lane-based discipline and mixed traffic conditions. [ABSTRACT FROM AUTHOR]

Abstract: Multi-agent systems allow the simulation of complex phenomena that cannot easily be described analytically. Multi-agent approaches are often based on coordinating agents whose actions and interactions are related to the emergence of the phenomenon to be simulated. In this article, we focus on road traffic simulation, specifically the design of a road traffic simulation tool able to deal realistically with road junctions. We propose a multi-agent behavioral model based on (i) the opportunistic individual behaviors that describe the norm violation and (ii) the anticipatory individual abilities of simulated drivers that allow critical situations to be detected. Our proposition has been validated for different traffic scenarios. Specifically, we simulated the traffic in a real intersection and then compared the simulated traffic flow with the real flow to highlight the relevance of our approach. [Copyright &y& Elsevier]

We describe the development of fast heuristics and methodologies for congestion minimization problems in directional wireless networks, and we compare their performance with optimal solutions. The focus is on the network layer topology control problem (NLTCP) defined by selecting an optimal ring topology as well as the flows on it. Solutions to NLTCP need to be computed in near realtime due to changing weather and other transient conditions and which generally preclude traditional optimization strategies. Using a mixed-integer linear programming formulation, we present both new constraints for this problem and fast heuristics to solve it. The new constraints are used to increase the lower bound from the linear programming relaxation and hence speed up the solution of the optimization problem by branch and bound. The upper and lower bounds for the optimal objective function to the mixed integer problem then serve to evaluate new node-swapping heuristics which we also present. Through a series of tests on different sized networks with different traffic demands, we show that our new heuristics achieve within about 0.5% of the optimal value within seconds. [ABSTRACT FROM AUTHOR]

We consider an example to show that the minimum instantaneous cost path principle, as suggested in Friesz et al. [1] for generalising Wardrop's first principle to the dynamic state, may cause some drivers' routes to ‘loop’. These looping routes traverse the same link more than once - indeed, in our example six times. [ABSTRACT FROM AUTHOR]

In this paper the authors find the optimal allocation of servicing periods to a facility servicing N incoming traffic streams. In our model it is assumed that stream flows are deterministic, that there is a fixed amount of lime lost, τi , when the server switches attention from the ith to the i + 1st stream and that the objective is to minimize time average delay. [ABSTRACT FROM AUTHOR]