Approximate network loading and dual-time-scale dynamic user equilibrium

In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.     

A generic class of first order node models for dynamic macroscopic simulation of traffic flows

Node models for macroscopic simulation have attracted relatively little attention in the literature. Nevertheless, in dynamic network loading (DNL) models for congested road networks, node models are as important as the extensively studied link models. This paper provides an overview of macroscopic node models found in the literature, explaining both their contributions and shortcomings. A formulation defining a generic class of first order macroscopic node models is presented, satisfying a list of requirements necessary to produce node models with realistic, consistent results. Defining a specific node model instance of this class requires the specification of a supply constraint interaction rule and (optionally) node supply constraints. Following this theoretical discussion, specific macroscopic node model instances for unsignalized and signalized intersections are proposed. These models apply an oriented capacity proportional distribution of the available supply over the incoming links of a node. A computationally efficient algorithm to solve the node models exactly is included.     

Schedule-based transit assignment model with vehicle capacity and seat availability

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.     

A shockwave profile model for traffic flow on congested urban arterials

In this paper a new traffic flow model for congested arterial networks, named shockwave profile model (SPM), is presented. Taking advantage of the fact that traffic states within a congested link can be simplified as free-flow, saturated, and jammed conditions, SPM simulates traffic dynamics by analytically deriving the trajectories of four major shockwaves: queuing, discharge, departure, and compression waves. Unlike conventional macroscopic models, in which space is often discretized into small cells for numerical solutions, SPM treats each homogeneous road segment with constant capacity as a section; and the queuing dynamics within each section are described by tracing the shockwave fronts. SPM is particularly suitable for simulating traffic flow on congested signalized arterials especially with queue spillover problems, where the steady-state periodic pattern of queue build-up and dissipation process may break down. Depending on when and where spillover occurs along a signalized arterial, a large number of queuing patterns may be possible. Therefore it becomes difficult to apply the conventional approach directly to track shockwave fronts. To overcome this difficulty, a novel approach is proposed as part of the SPM, in which queue spillover is treated as either extending a red phase or creating new smaller cycles, so that the analytical solutions for tracing the shockwave fronts can be easily applied. Since only the essential features of arterial traffic flow, i.e., queue build-up and dissipation, are considered, SPM significantly reduces the computational load and improves the numerical efficiency. We further validated SPM using real-world traffic signal data collected from a major arterial in the Twin Cities. The results clearly demonstrate the effectiveness and accuracy of the model. We expect that in the future this model can be applied in a number of real-time applications such as arterial performance prediction and signal optimization.     

Clockwise hysteresis loops in the Macroscopic Fundamental Diagram: An effect of network instability

A recent study reported that the Macroscopic Fundamental Diagram of a medium size city exhibited a clockwise hysteresis loop on a day in which a major disturbance caused many drivers to use unfamiliar routes. It is shown below that, even in a perfectly symmetric network with uniform demand, clockwise loops are to be expected when there are disturbances, especially if the disturbances cause a significant fraction of the drivers to not change routes adaptively. It is also shown that when drivers are not adaptive networks are inherently more unstable as they recover from congestion than as they are loaded. In other words, during recovery congestion tends more strongly toward unevenness because very congested areas clear more slowly than less congested areas. Since it is known that uneven congestion distributions reduce network flows, it follows that lower network flows should arise during recovery, resulting in clockwise loops. Fortunately, the presence of a sufficient number of drivers that choose routes adaptively to avoid congested areas helps to even out congestion during recovery, increasing flow. Thus, clockwise loops are less likely to occur when driver adaptivity is high.     

Frequency-based transit assignment considering seat capacities

This paper proposes a frequency-based assignment model that considers travellers probability of finding a seat in their perception of route cost and hence also their route choice. The model introduces a “fail-to-sit” probability at boarding points with travel costs based on the likelihood of travelling seated or standing. Priority rules are considered; in particular it is assumed that standing on-board passengers will occupy any available seats of alighting passengers before newly boarding passengers can fill any remaining seats. At the boarding point passengers are assumed to mingle, meaning that FIFO is not observed, as is the case for many crowded bus and metro stops, particularly in European countries. The route choice considers the common lines problem and an user equilibrium solution is sought through a Markov type network loading process and the method of successive averages. The model is first illustrated with a small example network before being applied to the inner zone of London’s underground network. The effect of different values passengers might attach to finding a seat are illustrated. Applications of the model for transit planning as well as for information provision at the journey planner stage are discussed.     

Bus congestion, optimal infrastructure investment and the choice of a fare collection system in dedicated bus corridors

Microeconomic optimisation of scheduled public transport operations has traditionally focused on finding optimal values for the frequency of service, capacity of vehicles, number of lines and distance between stops. In addition, however, there exist other elements in the system that present a trade-off between the interests of users and operators that have not received attention in the literature, such as the optimal selection of a fare payment system and a designed running speed (i.e., the cruising speed that buses maintain in between two consecutive stops). Alternative fare payment methods (e.g., on-board and off-board, payment by cash, magnetic strip or smart card) have different boarding times and capital costs, with the more efficient systems such as a contactless smart card imposing higher amounts of capital investment. Based on empirical data from several Bus Rapid Transit systems around the world, we also find that there is a positive relationship between infrastructure cost per kilometre and commercial speed (including stops), achieved by the buses, which we further postulate as a linear relationship between infrastructure investment and running speed. Given this context, we develop a microeconomic model for the operation of a bus corridor that minimises total cost (users and operator) and has five decision variables: frequency, capacity of vehicles, station spacing, fare payment system and running speed, thus extending the traditional framework. Congestion, induced by bus frequency, plays an important role in the design of the system, as queues develop behind high demand bus stops when the frequency is high. We show that (i) an off-board fare payment system is the most cost effective in the majority of circumstances; (ii) bus congestion results in decreased frequency while fare and bus capacity increase, and (iii) the optimal running speed grows with the logarithm of demand.     

Capacity drops at merges: An endogenous model

The Newell-Daganzo merge model is not only very simple but also accurately reproduces experimental findings. However, the capacity downstream of the merge is an exogenous variable in the model. This is a serious limitation for merges that behave as active bottlenecks because their downstream capacity is a direct consequence of the merging behavior. This paper proposes an analytical model that extends the Newell-Daganzo model by incorporating, endogenously, the capacity drop related to the merging process. Two cases are investigated depending on the traffic states on the on-ramp. The model properties are analyzed and a sensitivity analysis is performed to quantify the relative contribution of the each parameter in the capacity drop. Finally, the extended Newell-Daganzo model is validated with experimental data coming from an active merge bottleneck on the M6 freeway in UK.     

Increasing the capacity of signalized intersections with separate left turn phases

A separate turn phase is often used on the approach leg to an intersections with heavy left turns. This wastes capacity on the approach because some of its lanes cannot discharge during its green phases. The paper shows that the problem can be eliminated by reorganizing traffic on all the lanes upstream of an intersection using a mid-block pre-signal. If drivers behave deterministically, the capacity that can be achieved is the same as if there were no left turns. However, if the reorganization is too drastic, it may be counterintuitive to drivers. This can be remedied by reorganizing traffic on just some of the available lanes. It is shown that such partial reorganization still increases capacity significantly, even if drivers behave randomly and only one lane is reorganized. The paper shows how to optimize the design of a pre-signal system for a generic intersection. It also identifies both, the potential benefits of the proposed system for a broad class of intersections, and the domain of application where the benefits are most significant.     

利用列车比例模型风洞试验研究基础设施对列车气动力的影响

为了明确铁路轨道沿线横风所造成的危险,就必须探讨基础设施对列车气动载荷的影响.本文介绍了在标准的TSI基础设施(有碴轨道和无碴轨道以及6 m高路堤)和标准的意大利高架桥路面上,通过风洞试验所测试的ETR 500列车的气动力系数.每一种基础设施的特性都分为有列车和无列车2种状况进行研究.通过对比不同情况下的试验结果,指出...