A splitting rate model of traffic re-routeing and traffic control

Non peer reviewedPublisher PD

Combined travel forecasting models - formulations and algorithms

Consistent transportation forecasting models that combine travel demand and network assignment are receiving more attention in recent years. A fixed point formulation for the general combined model is presented. Measures for solution accuracy are discussed. An origin-based algorithm for solving combined models is proposed. Experimental results demonstrate the efficiency of the algorithm in comparison with prevailing alternatives.

Mechanisms that Govern how the Price of Anarchy varies with Travel Demand

Selfish routing, represented by the User-Equilibrium (UE) model, is known to be inefficient when compared to the System Optimum (SO) model. However, there is currently little understanding of how the magnitude of this inefficiency, which can be measured by the Price of Anarchy (PoA), varies across different structures of demand and supply. Such understanding would be useful for both transport policy and network design, as it could help to identify circumstances in which policy interventions that are designed to induce more efficient use of a traffic network, are worth their costs of implementation. This paper identifies four mechanisms that govern how the PoA varies with travel demand in traffic networks with separable and strictly increasing cost functions. For each OD movement, these are expansions and contractions in the sets of routes that are of minimum cost under UE and minimum marginal total cost under SO. The effects of these mechanisms on the PoA are established via a combination of theoretical proofs and conjectures supported by numerical evidence. In addition, for the special case of traffic networks with BPR-like cost functions having common power, it is proven that there is a systematic relationship between link flows under UE and SO, and hence between the levels of demand at which expansions and contractions occur. For this case, numerical evidence also suggests that the PoA has power law decay for large demand

Reducing urban traffic congestion due to localized routing decisions

Balancing traffic flow by influencing drivers' route choices to alleviate congestion is becoming increasingly more appealing in urban traffic planning. Here, we introduce a discrete dynamical model comprising users who make their own routing choices on the basis of local information and those who consider routing advice based on localized inducement. We identify the formation of traffic patterns, develop a scalable optimization method for identifying control values used for user guidance, and test the effectiveness of these measures on synthetic and real-world road networks

Route choice and traffic signal control: a study of the stability and instability of a new dynamical model of route choice and traffic signal control

This paper presents a novel idealised dynamical model of day to day traffic re-routeing (as traffic seeks cheaper routes) and proves a stability result for this dynamical model. (The dynamical model is based on swapping flow between paired alternative segments (these were introduced by Bar Gera (2010)) rather than between routes.) It is shown that under certain conditions the dynamical system enters a given connected set of approximate equilibria in a finite number of days or steps. This proof allows for saturation flows which act as potentially active flow constraints. The dynamical system involving paired alternative segment swaps is then combined with a novel green-time-swapping rule; this rule swaps green-time toward more pressurised signal stages. It is shown that if (i) the delay formulae have a simple form and (ii) the “pressure” formula fits the special control policy P0 (see Smith, 1979a, b), then the combined flow-swapping / green-time-swapping dynamical model also enters a given connected set of approximate consistent equilibria in a finite number of steps. Computational results confirm, in a simple network, the positive P0 result and also show, on the other hand, that such good behaviour may not arise if the equi-saturation control policy is utilized. The dynamical models described here do not represent blocking back effects

On multi-objective stochastic user equilibrium

There is extensive empirical evidence that travellers consider many 'qualities' (travel time, tolls, reliability, etc.) when choosing between alternative routes. Two main approaches exist to deal with this in network assignment models: Combine all qualities into a single (linear) utility function, or solve a multi-objective problem. The former has the advantages of a unique solution and efficient algorithms; the latter, however, is more general, but leads to many solutions and is difficult to implement in larger systems. In the present paper we present three alternative approaches for combining the principles of multi-objective decision-making with a stochastic user equilibrium model based on random utility theory. The aim is to deduce a tractable, analytic method. The three methods are compared both in terms of their theoretical principles, and in terms of the implied trade-offs, illustrated through simple numerical examples

A Framework for and Empirical Study of Algorithms for Traffic Assignment

Traffic congestion is an issue in most cities worldwide. Transportation engineers and urban planners develop various tra c management projects in order to solve this issue. One way to evaluate such projects is traffic assignment (TA). The goal of TA is to predict the behaviour of road users for a given period of time (morning and evening peaks, for example). Once such a model is created, it can be used to analyse the usage of a road network and to predict the impact of implementing a potential project. The most commonly used TA model is known as user equilibrium, which is based on the assumption that all drivers minimise their travel time or generalised cost. In this study, we consider the static deterministic user equilibrium TA model. The constant growth of road networks and the need of highly precise solutions (required for select link analysis, network design, etc) motivate researchers to propose numerous methods to solve this problem. Our study aims to provide a recommendation on what methods are more suitable depending on available computational resources, time and requirements on the solution. In order to achieve this goal, we implement a flexible software framework that maximises usage of common code and, hence, ensures comparison of algorithms on common ground. In order to identify similarities and differences of the methods, we analyse groups of algorithms that are based on common principles. In addition, we implement and compare several different methods for solving sub-problems and discuss issues related to accumulated numerical errors that might occur when highly accurate solutions are required