Morning commute in a single-entry traffic corridor with no late arrivals

This paper analyzes a model of early morning traffic congestion, that is a special case of the model considered in Newell (1988). A fixed number of identical vehicles travel along a single-lane road of constant width from a common origin to a common destination, with LWR flow congestion and Greenshields’ Relation. Vehicles have a common work start time, late arrivals are not permitted, and trip cost is linear in travel time and time early. The paper explores traffic dynamics for the social optimum, in which total trip cost is minimized, and for the user optimum, in which no vehicle’s trip cost can be reduced by altering its departure time. Closed-form solutions for the social optimum and quasi-analytic solutions for the user optimum are presented, along with numerical examples, and it is shown that this model includes the bottleneck model (with no late arrivals) as a limit case where the length of the road shrinks to zero.     

Travel time estimation for urban road networks using low frequency probe vehicle data

The paper presents a statistical model for urban road network travel time estimation using vehicle trajectories obtained from low frequency GPS probes as observations, where the vehicles typically cover multiple network links between reports. The network model separates trip travel times into link travel times and intersection delays and allows correlation between travel times on different network links based on a spatial moving average (SMA) structure. The observation model presents a way to estimate the parameters of the network model, including the correlation structure, through low frequency sampling of vehicle traces. Link-specific effects are combined with link attributes (speed limit, functional class, etc.) and trip conditions (day of week, season, weather, etc.) as explanatory variables. The approach captures the underlying factors behind spatial and temporal variations in speeds, which is useful for traffic management, planning and forecasting. The model is estimated using maximum likelihood. The model is applied in a case study for the network of Stockholm, Sweden. Link attributes and trip conditions (including recent snowfall) have significant effects on travel times and there is significant positive correlation between segments. The case study highlights the potential of using sparse probe vehicle data for monitoring the performance of the urban transport system.     

Discretised link travel time models based on cumulative flows: Formulations and properties

In the research area of dynamic traffic assignment, link travel times can be derived from link cumulative inflow and outflow curves which are generated by dynamic network loading. In this paper, the profiles of cumulative flows are piecewise linearized. Both the step function (SF) and linear interpolation (LI) are used to approximate cumulative flows over time. New formulations of the SF-type and LI-type link travel time models are developed. We prove that these two types of link travel time models ensure first-in-first-out (FIFO) and continuity of travel times with respect to flows, and have other desirable properties. Since the LI-type link travel time model does not satisfy the causality property, a modified LI-type (MLI-type) link travel time model is proposed in this paper. We prove that the MLI-type link travel time model ensures causality, strong FIFO and travel time continuity, and that the MLI-type link travel time function is strictly monotone under the condition that the travel time of each vehicle on a link is greater than the free flow travel time on that link. Numerical examples are set up to illustrate the properties and accuracy of the three models.     

Some features of non-linear travel time models for dynamic traffic assignment

Abstract

This paper investigates some features of non-linear travel time models for dynamic traffic assignment (DTA) that adopt traffic on the link as the sole determinant for the calculation of travel time and have explicit relationships between travel time and traffic on the link. Analytical proofs and numerical examples are provided to show first-in-first-out (FIFO) violation and the behaviour of decreasing outflow with increasing traffic in non-linear travel time models. It is analytically shown that any non-linear travel time model could violate FIFO in some circumstances, especially when inflow drops sharply, and some convex non-linear travel time models could show behaviour with outflow decreasing as traffic increases. It is also shown that the linear travel time model does not show these behaviours. A non-linear travel time model in general form was used for analytical proofs and several existing non-linear travel time models were adopted for numerical examples. Considering the features addressed in this study, non-linear travel time models seem to have limitations for use in DTA in practical terms and care should be taken when they are used for modelling time-varying transportation networks.     

A model and solution algorithm for dynamic deterministic user equilibrium assignment

Abstract

In this paper a route-based dynamic deterministic user equilibrium assignment model is presented. Some features of the linear travel time model are first investigated and then a divided linear travel time model is proposed for the estimation of link travel time: it addresses the limitations of the linear travel time model. For the application of the proposed model to general transportation networks, this paper provides thorough investigations on the computational issues in dynamic traffic assignment with many-to-many OD pairs and presents an efficient solution procedure. The numerical calculations demonstrate that the proposed model and solution algorithm produce satisfactory solutions for a network of substantial size with many-to-many OD pairs. Comparisons of assignment results are also made to show the impacts of incorporation of different link travel time models on the assignment results.     

Congestion-aware system optimal route choice for shared autonomous vehicles

We study the shared autonomous vehicle (SAV) routing problem while considering congestion. SAVs essentially provide a dial-a-ride service to travelers, but the large number of vehicles involved (tens of thousands of SAVs to replace personal vehicles) results in SAV routing causing significant congestion. We combine the dial-a-ride service constraints with the linear program for system optimal dynamic traffic assignment, resulting in a congestion-aware formulation of the SAV routing problem. Traffic flow is modeled through the link transmission model, an approximate solution to the kinematic wave theory of traffic flow. SAVs interact with travelers at origins and destinations. Due to the large number of vehicles involved, we use a continuous approximation of flow to formulate a linear program. Optimal solutions demonstrate that peak hour demand is likely to have greater waiting and in-vehicle travel times than off-peak demand due to congestion. SAV travel times were only slightly greater than system optimal personal vehicle route choice. In addition, solutions can determine the optimal fleet size to minimize congestion or maximize service.     

Arterial travel time estimation based on vehicle re-identification using wireless magnetic sensors

A practical system is described for the real-time estimation of travel time across an arterial segment with multiple intersections. The system relies on matching vehicle signatures from wireless sensors. The sensors provide a noisy magnetic signature of a vehicle and the precise time when it crosses the sensors. A match (re-identification) of signatures at two locations gives the corresponding travel time of the vehicle. The travel times for all matched vehicles yield the travel time distribution. Matching results can be processed to provide other important arterial performance measures including capacity, volume/capacity ratio, queue lengths, and number of vehicles in the link. The matching algorithm is based on a statistical model of the signatures. The statistical model itself is estimated from the data, and does not require measurement of ‘ground truth’. The procedure does not require measurements of signal settings; in fact, signal settings can be inferred from the matched vehicle results. The procedure is tested on a 1.5 km (0.9 mile)-long segment of San Pablo Avenue in Albany, CA, under different traffic conditions. The segment is divided into three links: one link spans four intersections, and two links each span one intersection.     

A robust optimization approach for dynamic traffic signal control with emission considerations

We consider an analytical signal control problem on a signalized network whose traffic flow dynamic is described by the Lighthill–Whitham–Richards (LWR) model (Lighthill and Whitham, 1955; Richards, 1956). This problem explicitly addresses traffic-derived emissions as constraints or objectives. We seek to tackle this problem using a mixed integer mathematical programming approach. Such class of problems, which we call LWR-Emission (LWR-E), has been analyzed before to certain extent. Since mixed integer programs are practically efficient to solve in many cases (Bertsimas et al., 2011b), the mere fact of having integer variables is not the most significant challenge to solving LWR-E problems; rather, it is the presence of the potentially nonlinear and nonconvex emission-related constraints/objectives that render the program computationally expensive.To address this computational challenge, we proposed a novel reformulation of the LWR-E problem as a mixed integer linear program (MILP). This approach relies on the existence of a statistically valid macroscopic relationship between the aggregate emission rate and the vehicle occupancy on the same link. This relationship is approximated with certain functional forms and the associated uncertainties are handled explicitly using robust optimization (RO) techniques. The RO allows emissions-related constraints and/or objectives to be reformulated as linear forms under mild conditions. To further reduce the computational cost, we employ a link-based LWR model to describe traffic dynamics with the benefit of fewer (integer) variables and less potential traffic holding. The proposed MILP explicitly captures vehicle spillback, avoids traffic holding, and simultaneously minimizes travel delay and addresses emission-related concerns.     

Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.     

Norm approximation method for handling traffic count inconsistencies in path flow estimator

Path flow estimator (PFE) is a one-stage network observer proposed to estimate path flows and hence origin–destination (O–D) flows from traffic counts in a transportation network. Although PFE does not require traffic counts to be collected on all network links when inferring unmeasured traffic conditions, it does require all available counts to be reasonably consistent. This requirement is difficult to fulfill in practice due to errors inherited in data collection and processing. The original PFE model handles this issue by relaxing the requirement of perfect replication of traffic counts through the specification of error bounds. This method enhances the flexibility of PFE by allowing the incorporation of local knowledge, regarding the traffic conditions and the nature of traffic data, into the estimation process. However, specifying appropriate error bounds for all observed links in real networks turns out to be a difficult and time-consuming task. In addition, improper specification of the error bounds could lead to a biased estimation of total travel demand in the network. This paper therefore proposes the norm approximation method capable of internally handling inconsistent traffic counts in PFE. Specifically, three norm approximation criteria are adopted to formulate three L_p-PFE models for estimating consistent path flows and O–D flows that simultaneously minimize the deviation between the estimated and observed link volumes. A partial linearization algorithm embedded with an iterative balancing scheme and a column generation procedure is developed to solve the three L_p-PFE models. In addition, the proposed L_p-PFE models are illustrated with numerical examples and the characteristics of solutions obtained by these models are discussed.     

A simulation model of the bus transitway (TRNSIM)

For planning and design of a bus rapid transit system and for the analysis of multimodal corridors, methodology is required for simulating bus traffic operation on a Transitway. Macroscopic models of vehicle flow are gaining popularity due to their capability to analyze complex operations and yet offer efficiency in development and applications. A macroscopic model is developed for the investigation of travel time, energy and emissions that correspond to bus volume levels on the Transitway. This paper describes the travel time part of the model. The model treats stochastic characteristics of bus traffic and passenger activities. Also, safety regimes in vehicle flow and factors affecting minimum headways in station areas are incorporated. The model is verified by comparing simulated travel time for the Ottawa-Carleton Transitway with actual data.     

Modeling Travel Time Under ATIS Using Mixed Linear Models

The objective of this paper is to model travel time when drivers are equipped with pre-trip and/or en-route real-time traffic information/advice. A travel simulator with a realistic network and real historical congestion levels was used as a data collection tool. The network included 40 links and 25 nodes. This paper presents models of the origin-to-destination travel time and en-route short-term route (link) travel time under five different types and levels of advanced traveler information systems (ATIS). Mixed linear models with the repeated observation's technique were used in both models. Different covariance structures (including the independent case) were developed and compared. The effect of correlation was found significant in both models. The trip travel time analysis showed that as the level of information increases (adding en-route to the pre-trip and advice to the advice-free information), the average travel time decreases. The model estimates show that providing pre-trip and en-route traffic information with advice could result in significant savings in the overall travel time. The en-route short-term (link) travel time analysis showed that the en-route short-term (link) information has a good chance of being used and followed. The short-term qualitative information is more likely to be used than quantitative information. Learning and being familiar with the system that provides the information decreases en-route short-term delay.     

Estimating travel times and vehicle trajectories on freeways using dual loop detectors

Recent research has investigated various means of measuring link travel times on freeways. This search has been motivated in part by the fact that travel time is considered to be more informative to users than local velocity measurements at a detector station. But direct travel time measurement requires the correlation of vehicle observations at multiple locations, which in turn requires new communications infrastructure and/or new detector hardware. This paper presents a method for estimating link travel time using data from an individual dual loop detector, without requiring any new hardware. The estimation technique exploits basic traffic flow theory to extrapolate local conditions to an extended link. In the process of estimating travel times, the algorithm also estimates vehicle trajectories. The work demonstrates that the travel time estimates are very good provided there are no sources of delay, such as an incident, within a link.     

The stability of stochastic equilibrium in a two-link transportation network

Most research and applications of network equilibrium models are based on the assumption that traffic volumes on roadways are virtually certain to be at or near their equilibrium values if the equilibrium volumes exist and are unique. However, it has long been known that this assumption can be violated in deterministic models. This paper presents an investigation of the stability of stochastic equilibrium in a two-link network. The stability of deterministic equilibrium also is discussed briefly. Equilibrium is defined to be stable if it is unique and the link volumes converge over time to their equilibrium values regardless of the initial conditions. Three models of route choice decision-making over time are formulated, and the stability of equilibrium is investigated for each. It is shown that even when equilibrium is unique, link volumes may converge to their equilibrium values, oscillate about equilibrium perpetually, or converge to values that may be considerably different from the equilibrium ones, depending on the details of the route choice decision-making process. Moreover, even when convergence of link volumes to equilibrium is assured, the convergence may be too slow to justify the standard assumption that these volumes are usually at or near their equilibrium values. When link volumes converge to non-equilibrium values, the levels at which the volumes stabilize typically depend on the initial link volumes or perceptions of travel costs. Conditions sufficient to assure convergence to equilibrium in two of the three models of route choice decision-making are presented, and these conditions are interpreted in terms of the route choice decision-making process.     

Estimating link travel time functions for heterogeneous traffic flows on freeways

Oversized vehicles, such as trucks, significantly contribute to traffic delays on freeways. Heterogeneous traffic populations, that is, those consisting of multiple vehicles types, can exhibit more complicated travel behaviors in the operating speed and performance, depending on the traffic volume as well as the proportions of vehicle types. In order to estimate the component travel time functions for heterogeneous traffic flows on a freeway, this study develops a microscopic traffic‐simulation based four‐step method. A piecewise continuous function is proposed for each vehicle type and its parameters are estimated using the traffic data generated by a microscopic traffic simulation model. The illustrated experiments based on VISSIM model indicate that (i) in addition to traffic volume, traffic composition has significant influence on the travel time of vehicles and (ii) the respective estimations for travel time of heterogeneous flows could greatly improve their estimation accuracy. Copyright © 2016 John Wiley & Sons, Ltd.     

A bi-level model of dynamic traffic signal control with continuum approximation

This paper proposes a bi-level model for traffic network signal control, which is formulated as a dynamic Stackelberg game and solved as a mathematical program with equilibrium constraints (MPEC). The lower-level problem is a dynamic user equilibrium (DUE) with embedded dynamic network loading (DNL) sub-problem based on the LWR model (Lighthill and Whitham, 1955; Richards, 1956). The upper-level decision variables are (time-varying) signal green splits with the objective of minimizing network-wide travel cost. Unlike most existing literature which mainly use an on-and-off (binary) representation of the signal controls, we employ a continuum signal model recently proposed and analyzed in Han et al. (2014), which aims at describing and predicting the aggregate behavior that exists at signalized intersections without relying on distinct signal phases. Advantages of this continuum signal model include fewer integer variables, less restrictive constraints on the time steps, and higher decision resolution. It simplifies the modeling representation of large-scale urban traffic networks with the benefit of improved computational efficiency in simulation or optimization. We present, for the LWR-based DNL model that explicitly captures vehicle spillback, an in-depth study on the implementation of the continuum signal model, as its approximation accuracy depends on a number of factors and may deteriorate greatly under certain conditions. The proposed MPEC is solved on two test networks with three metaheuristic methods. Parallel computing is employed to significantly accelerate the solution procedure.     

A highway capacity function in Korea: Measurement and calibration

Capacity functions are important in the model that accounts for the user's route choice behavior based on the traveller's perception of the travel time. This is because a capacity function represents the relationship between the traffic volume and the travel time on the link. The capacity function developed by the U.S. Bureau of Public Roads (BPR) has been used in many countries, including Korea, without much effort to calibrate the parameters for its own transportation environment. Countries other than the United States, however, have distinctive demographic, economic, cultural, and behavioral characteristics; and they might need unique capacity functions for their own environments. Thus, it is important for Korea to have its own capacity function that can appropriately represent the Korea highway environment. Any attempt to model the Korean highway system without using a suitable capacity function might result in inappropriate solutions, because most modeling activities are crucially based on link travel time, and it is the capacity function that furnishes those link travel time. A link capacity function for Korea is calibrated based on a BPR type formula utilizing an alternative method. The alternative method is developed in a bilevel programming framework that uses link volume counts instead of link flow and travel time data. Detailed calibration results are reported.     

Traffic Performance Models for Dynamic Traffic Assignment: An Assessment of Existing Models

Abstract

This paper provides a review of the traffic performance models for dynamic traffic assignment (DTA) and it identifies the strength and weakness of existing models. Requirements for traffic performance models are identified and various forms of existing traffic performance models for DTA are reviewed and analysed according to the requirements. Non‐linear travel time models are shown to have some deficiencies that make them unsuitable for the analysis of time‐varying transportation networks. Even though linear‐type travel time models are identified as good candidates for the analysis of dynamic transportation networks, they have limitations from the practical point of view that travel time increases only linearly with the amount of traffic on the link. This poses a dilemma and it seems to be one whose resolution is an imminent precondition for DTA modelling to progress in a way that is both theoretically coherent and plausible in practical terms.     

Modelling rain effects on risk‐taking behaviours of multi‐user classes in road networks with uncertainty

This paper proposes a new travel time reliability‐based traffic assignment model to investigate the rain effects on risk‐taking behaviours of different road users in networks with day‐to‐day demand fluctuations and variations in travel time. A generalized link travel time function is used to capture the rain effects on vehicle travel times and road conditions. This function is further incorporated into daily demand variations to investigate those travel time variations arising from demand uncertainty and rain condition. In view of these rain effects, road users' perception errors on travel times and risk‐taking behaviours on path choices are incorporated in the proposed model with the use of a logit‐based stochastic user equilibrium framework. This new model is formulated as a variational inequality problem in terms of path flows. A numerical example is used to illustrate the application of the proposed model for assessment of the rain effects on road networks with uncertainty.     

Network-wide adaptive tolling for connected and automated vehicles

This article proposes Δ-tolling, a simple adaptive pricing scheme which only requires travel time observations and two tuning parameters. These tolls are applied throughout a road network, and can be updated as frequently as travel time observations are made. Notably, Δ-tolling does not require any details of the traffic flow or travel demand models other than travel time observations, rendering it easy to apply in real-time. The flexibility of this tolling scheme is demonstrated in three specific traffic modeling contexts with varying traffic flow and user behavior assumptions: a day-to-day pricing model using static network equilibrium with link delay functions; a within-day adaptive pricing model using the cell transmission model and dynamic routing of vehicles; and a microsimulation of reservation-based intersection control for connected and autonomous vehicles with myopic routing. In all cases, Δ-tolling produces significant benefits over the no-toll case, measured in terms of average travel time and social welfare, while only requiring two parameters to be tuned. Some optimality results are also given for the special case of the static network equilibrium model with BPR-style delay functions.