On the convergence of the method of successive averages for calculating user equilibrium in traffic networks

Peer reviewedPostprin

Extending travel-time based models for dynamic network loading and assignment, to achieve adherence to first-in-first-out and link capacities

AbstractAn important class of models for macroscopic dynamic network loading (DNL) and dynamic traffic assignment (DTA) is based on treating link travel times as a function of link occupancy. However, these models suffer from some problems or deficiencies namely (a) the link outflows can violate first-in-first-out (FIFO), (b) the link outflows can exceed the link outflow capacities, (c) the link inflows can exceed the link inflow capacities, and (d) the link occupancies can exceed the link occupancy capacities. In this paper we introduce methods to overcome each of these problems.To remove problems (a) and (b) we extend the link travel-time model to better reflect behaviour when traffic flow is varying over time. To remove problems (c) and (d) we introduce more substantial changes in the model, to introduce capacities, spillback and queues compatible with the model. These extensions strengthen the realism, behavioural basis and usability of the link travel-time model and the DNL and DTA models that are based on it. They have no obvious adverse implications or side effects and require little additional computational effort. The original model is a special case of the new/extended model: the above extensions are activated if and only if any of the problems (a)–(d) arise, otherwise the new model reduces to the original model

Travel-Time Models With and Without Homogeneity Over Time

In dynamic network loading and dynamic traffic assignment for networks, the link travel time is often taken as a function of the number of vehicles x(t) on the link at time t of entry to the link, that is, τ(t) = f(x(t)), which implies that the performance of the link is invariant (homogeneous) over time. Here we let this relationship vary over time, letting the travel time depend directly on the time of day, thus τ(t) = f(x(t), t). Various authors have investigated the properties of the previous (homogeneous) model, including conditions sufficient to ensure that it satisfies first-in-first-out (FIFO). Here we extend these results to the inhomogeneous model, and find that the new sufficient conditions have a natural interpretation. We find that the results derived by several previous authors continue to hold if we introduce one additional condition, namely that the rate of change of f(x(t), t) with respect to the second parameter has a certain (negative) lower bound. As a prelude, we discuss the equivalence of equations for flow propagation equations and for intertemporal conservation of flows, and argue that neither these equations nor the travel-time model are physically meaningful if FIFO is not satisfied. In §7 we provide some examples of time-dependent travel times and some numerical illustrations of when these will or will not adhere to FIFO

Dynamic traffic assignment approximating the kinematic wave model: system optimum, marginal costs, externalities and tolls

System marginal costs, externalities and optimal congestion tolls for traffic networks are generally derived from system optimizing (SO) traffic assignment models and when these are treated as varying over time they are all referred to as dynamic. In dynamic SO network models the link flows and travel times or costs are generally modelled using so-called ‘whole link’ models. Here we instead develop an SO model that more closely reflects traffic flow theory and derive the marginal costs and externalities from that. The most widely accepted traffic flow model appears to be the LWR (Lighthill, Whitham and Richards) model and a tractable discrete implementation or approximation to that is provided by the cell transmission model (CTM) or a finite difference approximation (FDA). These handles spillbacks, traffic controls and moving queues in a way that is consistent with the LWR model (hence with the kinematic wave model and fluid flow model). An SO formulation using the CTM is already available, assuming a single destination and a trapezoidal flow-density function. We extend the formulation to allow more general nonlinear flow density functions and derive and interpret system marginal costs and externalities. We show that if tolls computed from the DSO solution are imposed on users then the DSO solution would also satisfy the criteria for a dynamic user equilibrium (DUE). We introduce constraints on the link outflow proportions at merges and inflow proportions at diverges. We also extend the model to elastic demands and establish links with previous dynamic traffic assignment (DTA) models

Link travel times 11: properties derived from traffic-flow models

We investigate the properties of travel times when the latter are derived from traffic-flow models. In particular we consider exit-flow models, which have been used to model time-varying flows on road networks, in dynamic traffic assignment (DTA). But we here define the class more widely to include, for example, models based on finite difference approximations to the LWR (Lighthill, Whitham and Richards) model of traffic flow, and ‘large step’ versions of these. For the derived travel times we investigate the properties of existence, uniqueness, continuity, first-in-first-out (FIFO), causality and time-flow consistency (or intertemporal consistency). We assume a single traffic type and assume that time may be treated as continuous or as discrete, and for each case we obtain conditions under which the above properties are satisfied, and interrelations among the properties. For example, we find that FIFO is easily satisfied, but not strict causality, and find that if we redefine travel time to ensure strict causality then we lose time-flow consistency, and that neither of these conditions is strictly necessary or sufficient for FIFO. All of the models can be viewed as an approximation to a model that is continuous in time and space (the LWR model), and it seems that any loss of desirable properties is the price we pay for using such approximations. We also extend the exit-flow models and results to allow ‘inhomogeneity ’ over time (link capacity or other parameters changing over time), and show that FIFO is still ensured if the exit-flow function is defined appropriately

Network equilibrium: Optimization formulations with both quantities and prices as variables

The optimization formulation of the traffic assignment problem is usually stated in terms of flow (quantity) variables but can also be stated entirely in terms of price variables (the dual formulation), and recently it has also been stated in terms of a combination of both quantity and price variables. Here we consider properties and problems associated with the latter optimization formulations and relate these formulations to the traffic equilibrium conditions and to the purely quantity formulation.

A model and strategy for train pathing with choice of lines, platforms, and routes

Train pathing is concerned with assigning trains and train times for a set of rail links, stations stops, etc., so as to meet a system of constraints on headways, trip times, dwell times, etc. while minimizing delays or costs and meeting travel demands. In a previous paper we presented a model, algorithms, and strategy for pathing trains of different speeds and stopping patterns for a double track rail line dedicated to trains in one direction. Here we extend this to more general more complex rail networks, with choice of lines, station platforms, etc, as is more typical of the high density scheduled passenger railways in Britain and Europe. We apply the model to a small network and find acceptable solution times. Applying addition search strategies from the previous paper should reduce solution times by further orders of magnitude.