Some errors in macroscopic traffic models based on car following models

The macroscopic traffic flow models developed from the car following models of Gazis et al. (1961) are shown to have a flaw in that they do not meet certain of the boundary conditions that researchers have said that they do. This does not affect many existing models but, nevertheless, should be cleared up.     

Simplified transport models based on traffic counts

Having accepted the need for the development of simpler and less cumbersome transport demand models, the paper concentrates on one possible line for simplification: estimation of trip matrices from link volume counts. Traffic counts are particularly attractive as a data basis for modelling because of their availability, low cost and nondisruptive character. It is first established that in normal conditions it may be possible to find more than one trip matrix which, when loaded onto a network, reproduces the observed link volumes. The paper then identifies three approaches to reduce this underspecification problem and produce a unique trip matrix consistent with the counts. The first approach consists of assuming that trip-making behaviour can be explained by a gravity model whose parameters can be calibrated from the traffic counts. Several forms of this gravity model have been put forward and they are discussed in Section 3. The second approach uses mathematical programming techniques associated to equilibrium assignment problems to estimate a trip matrix in congested areas. This method can also be supplemented by a special distribution model developed for small areas. The third approach relies on entropy and information theory considerations to estimate the most likely trip matrix consistent with the observed flows. A particular feature of this group is that they can include prior, perhaps outdated, information about the matrix.These three approaches are then compared and their likely areas for application identified. Problems for further research are discussed and finally an assessment is made of the possible role of these models vis-a-vis recent developments in transport planning.     

Development of network restructuring models for improved air traffic forecasts

Current air traffic forecast methods employed by the United States Federal Aviation Administration function under the assumption that the structure of the network of routes operated by airlines will not change; that is, no new routes will be added nor existing ones removed. However, in reality the competitive nature of the airline industry is such that new routes are routinely added between cities possessing significant passenger demand; city-pairs are also removed. Such phenomena generates a gap between the forecasted and actual state of the US Air Transportation System in the long term, providing insufficient situational awareness to major stakeholders and decision-makers in their consideration of major policy and technology changes. To address this gap, we have developed and compared three algorithms that forecast the likelihood of un-connected city-pairs being connected by service in the future, primarily based on the nodal characteristics of airports in the US network. Validation is performed by feeding historical data to each algorithm and then comparing the accuracy and precision of new city-pairs forecasted using knowledge of actual new city-pairs that developed. While an Artificial Neural Network produces superior precision, fitness function and logistic regression algorithms provide good representation of the distribution of new route types as well as greater flexibility for modeling future scenarios. However, these latter two algorithms face difficulty in resolving differences among the large number of ‘spoke’ airports in the network – additional parameters that may be able to differentiate them are currently under review. These insights gained are valuable stepping stones for exploiting knowledge of restructuring in the service route network to improve overall forecasts that drive policy and technology decision-making.     

On the macroscopic stability of freeway traffic

A simple model of traffic flow is used to analyze the spatio-temporal distribution of flow and density on closed-loop homogeneous freeways with many ramps, which produce inflows and allow outflows. As we would expect, if the on-ramp demand is space-independent then this distribution tends toward uniformity in space if the freeway is either: (i) uncongested; or (ii) congested with queues on its on-ramps and enough inflow to cause the average freeway density to increase with time. In all other cases, however, including any recovery phase of a rush hour where the freeway’s average density declines, the distribution of flow and density quickly becomes uneven. This happens even under conditions of perfect symmetry, where the percentage of vehicles exiting at every off ramp is the same. The flow-density deviations from the average are shown to grow exponentially in time and propagate backwards in space with a fixed wave speed. A consequence of this type of instability is that, during recovery, gaps of uncongested traffic will quickly appear in the unevenly congested stream, reducing average flow. This extends the duration of recovery and invariably creates clockwise hysteresis loops on scatter-plots of average system flow vs. density during any rush hour that oversaturates the freeway. All these effects are quantified with formulas and verified with simulations. Some have been observed in real networks. In a more practical vein, it is also shown that the negative effects of instability diminish (i.e., freeway flows increase) if (a) some drivers choose to exit the freeway prematurely when it is too congested and/or (b) freeway access is regulated in a certain traffic-responsive way. These two findings could be used to improve the algorithms behind VMS displays for driver guidance (finding a), and on-ramp metering rates (finding b).     

Characterization and prediction of air traffic delays

This paper presents a new class of models for predicting air traffic delays. The proposed models consider both temporal and spatial (that is, network) delay states as explanatory variables, and use Random Forest algorithms to predict departure delays 2–24 h in the future. In addition to local delay variables that describe the arrival or departure delay states of the most influential airports and links (origin–destination pairs) in the network, new network delay variables that characterize the global delay state of the entire National Airspace System at the time of prediction are proposed. The paper analyzes the performance of the proposed prediction models in both classifying delays as above or below a certain threshold, as well as predicting delay values. The models are trained and validated on operational data from 2007 and 2008, and are evaluated using the 100 most-delayed links in the system. The results show that for a 2-h forecast horizon, the average test error over these 100 links is 19% when classifying delays as above or below 60 min. Similarly, the average over these 100 links of the median test error is found to be 21 min when predicting departure delays for a 2-h forecast horizon. The effects of changes in the classification threshold and forecast horizon on prediction performance are studied.     

A family of macroscopic node models

The family of macroscopic node models which comply to a set of basic requirements is presented and analysed. Such models are required in macro-, mesoscopic traffic flow models, including dynamic network loading models for dynamic traffic assignment. Based on the behaviour of drivers approaching and passing through intersections, the model family is presented. The headway and the turn delay of vehicles are key variables. Having demand and supply as input creates a natural connection to macroscopic link models. Properties like the invariance principle and the conservation of turning fractions are satisfied. The inherent non-uniqueness is analysed by providing the complete set of feasible solutions. The node models proposed by Tampère et al. (2011), Flötteröd and Rohde (2011) and Gibb (2011) are members of the family. Furthermore, two new models are added to the family. Solution methods for all family members are presented, as well as a qualitative and quantitative comparison. Finally, an outlook for the future development of empirically verified models is given.     

Mixed manual/semi-automated traffic: a macroscopic analysis

The use of advanced technologies and intelligence in vehicles and infrastructure could make the current highway transportation system much more efficient. Semi-automated vehicles with the capability of automatically following a vehicle in front as long as it is in the same lane and in the vicinity of the forward looking ranging sensor are expected to be deployed in the near future. Their penetration into the current manual traffic will give rise to mixed manual/semi-automated traffic. In this paper, we analyze the fundamental flow–density curve for mixed traffic using flow–density curves for 100% manual and 100% semi-automated traffic. Assuming that semi-automated vehicles use a time headway smaller than today’s manual traffic average due to the use of sensors and actuators, we have shown using the flow–density diagram that the traffic flow rate will increase in mixed traffic. We have also shown that the flow–density curve for mixed traffic is restricted between the flow–density curves for 100% manual and 100% semi-automated traffic. We have presented in a graphical way that the presence of semi-automated vehicles in mixed traffic propagates a shock wave faster than in manual traffic. We have demonstrated that the presence of semi-automated vehicles does not change the total travel time of vehicles in mixed traffic. Though we observed that with 50% semi-automated vehicles a vehicle travels 10.6% more distance than a vehicle in manual traffic for the same time horizon and starting at approximately the same position, this increase is marginal and is within the modeling error. Lastly, we have shown that when shock waves on the highway produce stop-and-go traffic, the average delay experienced by vehicles at standstill is lower in mixed traffic than in manual traffic, while the average number of vehicles at standstill remains unchanged.     

Properties of a well-defined macroscopic fundamental diagram for urban traffic

A field experiment in Yokohama (Japan) revealed that a macroscopic fundamental diagram (MFD) linking space-mean flow, density and speed exists on a large urban area. It was observed that when the highly scattered plots of flow vs. density from individual fixed detectors were aggregated the scatter nearly disappeared and points grouped along a well defined curve. Despite these and other recent findings for the existence of well-defined MFDs for urban areas, these MFDs should not be universally expected. In this paper we investigate what are the properties that a network should satisfy, so that an MFD with low scatter exists. We show that the spatial distribution of vehicle density in the network is one of the key components that affect the scatter of an MFD and its shape. We also propose an analytical derivation of the spatial distribution of congestion that considers correlation between adjacent links. We investigate the scatter of an MFD in terms of errors in the probability density function of spatial link occupancy and errors of individual links’ fundamental diagram (FD). Later, using real data from detectors for an urban arterial and a freeway network we validate the proposed derivations and we show that an MFD is not well defined in freeway networks as hysteresis effects are present. The datasets in this paper consist of flow and occupancy measures from 500 fixed sensors in the Yokohama downtown area in Japan and 600 loop detectors in the Twin Cities Metropolitan Area Freeway network in Minnesota, USA.     

An analytical approximation for the macroscopic fundamental diagram of urban traffic

This paper shows that a macroscopic fundamental diagram (MFD) relating average flow and average density must exist on any street with blocks of diverse widths and lengths, but no turns, even if all or some of the intersections are controlled by arbitrarily timed traffic signals. The timing patterns are assumed to be fixed in time. Exact analytical expressions in terms of a shortest path recipe are given, both, for the street’s capacity and its MFD. Approximate formulas that require little data are also given.For networks, the paper derives an upper bound for average flow conditional on average density, and then suggests conditions under which the bound should be tight; i.e., under which the bound is an approximate MFD. The MFD’s produced with this method for the central business districts of San Francisco (California) and Yokohama (Japan) are compared with those obtained experimentally in earlier publications.     

Recent developments in traffic flow modeling using macroscopic fundamental diagram

ABSTRACT

This paper presents an overview of the recent developments in traffic flow modelling and analysis using macroscopic fundamental diagram (MFD) as well as their applications. In recent literature, various aggregated traffic models have been proposed and studied to analyse traffic flow while enhancing network efficiency. Many of these studies have focused on models based on MFD that describes the relationship between aggregated flow and aggregated density of transport networks. The analysis of MFD has been carried out based on experimental data collected from sensors and GPS, as well as simulation models. Several factors are found to influence the existence and shape of MFD, including traffic demand, network and signal settings, and route choices. As MFD can well express the traffic dynamics of large urban transport networks, it has been extensively applied to traffic studies, including the development of network-wide control strategies, network partitioning, performance evaluation, and road pricing. This work also presents future extensions and research directions for MFD-based traffic modelling and applications.     

Short-term traffic flow rate forecasting based on identifying similar traffic patterns

The ability to timely and accurately forecast the evolution of traffic is very important in traffic management and control applications. This paper proposes a non-parametric and data-driven methodology for short-term traffic forecasting based on identifying similar traffic patterns using an enhanced K-nearest neighbor (K-NN) algorithm. Weighted Euclidean distance, which gives more weight to recent measurements, is used as a similarity measure for K-NN. Moreover, winsorization of the neighbors is implemented to dampen the effects of dominant candidates, and rank exponent is used to aggregate the candidate values. Robustness of the proposed method is demonstrated by implementing it on large datasets collected from different regions and by comparing it with advanced time series models, such as SARIMA and adaptive Kalman Filter models proposed by others. It is demonstrated that the proposed method reduces the mean absolute percent error by more than 25%. In addition, the effectiveness of the proposed enhanced K-NN algorithm is evaluated for multiple forecast steps and also its performance is tested under data with missing values. This research provides strong evidence suggesting that the proposed non-parametric and data-driven approach for short-term traffic forecasting provides promising results. Given the simplicity, accuracy, and robustness of the proposed approach, it can be easily incorporated with real-time traffic control for proactive freeway traffic management.     

The principles of calibrating traffic microsimulation models

Traffic microsimulation models normally include a large number of parameters that must be calibrated before the model can be used as a tool for prediction. A wave of methodologies for calibrating such models has been recently proposed in the literature, but there have been no attempts to identify general calibration principles based on their collective experience. The current paper attempts to guide traffic analysts through the basic requirements of the calibration of microsimulation models. Among the issues discussed here are underlying assumptions of the calibration process, the scope of the calibration problem, formulation and automation, measuring goodness-of-fit, and the need for repeated model runs.

A macroscopic traffic model for highway work zones: Formulations and numerical results

This study presents a multilane model for analyzing the dynamic traffic properties of a highway segment under a lane‐closure operation that often incurs complex interactions between mandatory lane‐changing vehicles and traffic at unblocked lanes. The proposed traffic flow formulations employ the hyperbolic model used in the non‐Newtonian fluid dynamics, and assume the lane‐changing intensity between neighboring lanes as a function of their difference in density. The results of extensive simulation experiments indicate that the proposed model is capable of realistically replicating the impacts of lane‐changing maneuvers from the blocked lanes on the overall traffic conditions, including the interrelations between the approaching flow density, the resulting congestion level, and the exiting flow rate from the lane‐closure zone. Our extensive experimental analyses also confirm that traffic conditions will deteriorate dramatically and evolve to the state of traffic jam if the density has exceeded its critical level that varies with the type of lane‐closure operations. This study also provides a convenient way for computing such a critical density under various lane‐closure conditions, and offers a theoretical basis for understanding the formation as well as dissipation of traffic jam.     

Network models in traffic management and control

Abstract

The context for network modelling in traffic management and control is described in terms of the current area‐wide nature of traffic management and the range of objectives to which it can contribute. Representation of a road system and traffic management measures in terms of nodes and links and parameters associated with them is described. It is shown that the pattern of traffic has to be represented not only in terms of flows on links of the network but also in terms of numbers of movements per unit time between points of entry to and points of exit from the area being modelled. In modelling so far, these numbers of movements are regarded as given, but the routes taken are estimated by traffic assignment. Models can so far be used for comparison of a range of given schemes and for optimization of traffic control within a scheme. Variation over time is a central feature of the modelling, and this requires the use of time‐dependent queueing theory, and the specification of numbers of movements for a succession of periods of between 10 and 30 minutes. Theoretical approaches to the resulting problems of modelling and optimization are discussed, and the ways in which these are supplemented by heuristic methods in currently available models is described. Some requirements‐for further research are outlined.     

A review of Australian traffic system design models

The demands for traffic infrastructure are increasing. Yet over the last decade investment in new infrastructure has decreased at all levels. Traffic systems designers are, therefore, being asked to be more accurate in their prediction of the impacts of changes, to analyse ever more complex situations and to extract more from the existing traffic system. This paper reviews developments in techniques for analysing the impacts of changes in the traffic system. It looks at intersection, route, network, parking lot and public transport design models that have been developed in Australia. Particular emphasis is given to the considerable developments in microcomputers and graphics and the impact these are having on the models. Future developments are also discussed.     

Analytical model of traffic delays under bus signal preemption: Theory and application

Major emphasis has been placed in recent years on the improvement of the operations of existing transportation facilities, using Transportation Systems Management strategies. Accordingly, preferential treatment of high occupancy vehicles is playing an increasing role in transportation projects. This paper deals with one of these strategies, the priority treatment of buses at signalized intersections. Such treatment is aimed at improving the capacity of intersections. The paper develops an analytical model of delays at signalized intersections under a bus preemption scheme. The analysis is presented for the simplest case, i.e., two intersecting one-way streets. The results suggests that the benefits of bus preemption can be increased by properly adjusting several design parameters such as cycle and phase duration of the preempted phases as well as the non-preempted parameters. The model outlined in this paper is applicable to any situation in which stochastic variation is introduced into the signal cycle as well as to bus preemption. Consequently, other potential applications of the model include the design/analysis of traffic actuated signals, and pedestrian actuated signals.     

Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks

In this paper, we propose a new model for the within-day Dynamic Traffic Assignment (DTA) on road networks where the simulation of queue spillovers is explicitly addressed, and a user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles, i.e., in the infinite dimension space of time’s functions. The model integrates spillback congestion into an existing formulation of the DTA based on continuous-time variables and implicit path enumeration, which is capable of explicitly representing the formation and dispersion of vehicle queues on road links, but allows them to exceed the arc length. The propagation of congestion among adjacent arcs will be achieved through the introduction of time-varying exit and entry capacities that limit the inflow on downstream arcs in such a way that their storage capacities are never exceeded. Determining the temporal profile of these capacity constraints requires solving a system of spatially non-separable macroscopic flow models on the supply side of the DTA based on the theory of kinematic waves, which describe the dynamic of the spillback phenomenon and yield consistent network performances for given arc flows. We also devise a numerical solution algorithm of the proposed continuous-time formulation allowing for “long time intervals” of several minutes, and give an empirical evidence of its convergence. Finally, we carry out a thorough experimentation in order to estimate the relevance of spillback modeling in the context of the DTA, compare the proposed model in terms of effectiveness with the Cell Transmission Model, and assess the efficiency of the proposed algorithm and its applicability to real instances with large networks.     

Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models

Transportation - The planning of on-demand services requires the formation of vehicle schedules consisting of service trips and empty trips. This paper presents an algorithm for building vehicle...     

Validation of traffic flow models with respect to the spatiotemporal evolution of congested traffic patterns

We propose a quantitative approach for calibrating and validating key features of traffic instabilities based on speed time series obtained from aggregated data of a series of neighboring stationary detectors. The approach can be used to validate models that are calibrated by other criteria with respect to their collective dynamics. We apply the proposed criteria to historic traffic databases of several freeways in Germany containing about 400 occurrences of congestions thereby providing a reference for model calibration and quality assessment with respect to the spatiotemporal dynamics. First tests with microscopic and macroscopic models indicate that the criteria are both robust and discriminative, i.e., clearly distinguishes between models of higher and lower predictive power.     

Macroscopic traffic models for vehicle-follower automated transportation systems

The problem of distributing and routing vehicles in a large automated transportation network may be approached through the design of on-line control algorithms, particularly when the network contains many origin-destination pairs and alternate routes. To develop such algorithms, it is necessary to obtain models that accurately represent the dynamic behavior of vehicles on the guideway network. In this paper, models based on density, flow and average velocity variables are derived for the vehicle-follower longitudinal control scheme. Models suitable for use in analysis and simulation work are developed for links, merges, diverges, and stations. The proposed models are shown to compare favorably with simulation results that use explicit modeling of vehicle dynamic modeling of vehicle dynamic interaction.