User equilibrium traffic network assignment with stochastic travel times and late arrival penalty

The classical Wardrop user equilibrium (UE) assignment model assumes traveller choices are based on fixed, known travel times, yet these times are known to be rather variable between trips, both within and between days; typically, then, only mean travel times are represented. Classical stochastic user equilibrium (SUE) methods allow the mean travel times to be differentially perceived across the population, yet in a conventional application neither the UE or SUE approach recognises the travel times to be inherently variable. That is to say, there is no recognition that drivers risk arriving late at their destinations, and that this risk may vary across different paths of the network and according to the arrival time flexibility of the traveller. Recent work on incorporating risky elements into the choice process is seen either to neglect the link to the arrival constraints of the traveller, or to apply only to restricted problems with parallel alternatives and inflexible travel time distributions. In the paper, an alternative approach is described based on the ‘schedule delay’ paradigm, penalising late arrival under fixed departure times. The approach allows flexible travel time densities, which can be fitted to actual surveillance data, to be incorporated. A generalised formulation of UE is proposed, termed a Late Arrival Penalised UE (LAPUE). Conditions for the existence and uniqueness of LAPUE solutions are considered, as well as methods for their computation. Two specific travel time models are then considered, one based on multivariate Normal arc travel times, and an extended model to represent arc incidents, based on mixture distributions of multivariate Normals. Several illustrative examples are used to examine the sensitivity of LAPUE solutions to various input parameters, and in particular its comparison with UE predictions. Finally, paths for further research are discussed, including the extension of the model to include elements such as distributed arrival time constraints and penalties

Modelling public transport accessibility with Monte Carlo stochastic simulations: A case study of Ostrava

Activity-based micro-scale simulation models for transport modelling provide better evaluations of public transport accessibility, enabling researchers to overcome the shortage of reliable real-world data. Current simulation systems face simplifications of personal behaviour, zonal patterns, non-optimisation of public transport trips (choice of the fastest option only), and do not work with real targets and their characteristics. The new TRAMsim system uses a Monte Carlo approach, which evaluates all possible public transport and walking origin-destination (O-D) trips for k-nearest stops within a given time interval, and selects appropriate variants according to the expected scenarios and parameters derived from local surveys. For the city of Ostrava, Czechia, two commuting models were compared based on simulated movements to reach (a) randomly selected large employers and (b) proportionally selected employers using an appropriate distance-decay impedance function derived from various combinations of conditions. The validation of these models confirms the relevance of the proportional gravity-based model. Multidimensional evaluation of the potential accessibility of employers elucidates issues in several localities, including a high number of transfers, high total commuting time, low variety of accessible employers and high pedestrian mode usage. The transport accessibility evaluation based on synthetic trips offers an improved understanding of local situations and helps to assess the impact of planned changes.Web of Science1124art. no. 709

Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data

Constraint Programming (CP) has proved an effective paradigm to model and solve difficult combinatorial satisfaction and optimisation problems from disparate domains. Many such problems arising from the commercial world are permeated by data uncertainty. Existing CP approaches that accommodate uncertainty are less suited to uncertainty arising due to incomplete and erroneous data, because they do not build reliable models and solutions guaranteed to address the user's genuine problem as she perceives it. Other fields such as reliable computation offer combinations of models and associated methods to handle these types of uncertain data, but lack an expressive framework characterising the resolution methodology independently of the model. We present a unifying framework that extends the CP formalism in both model and solutions, to tackle ill-defined combinatorial problems with incomplete or erroneous data. The certainty closure framework brings together modelling and solving methodologies from different fields into the CP paradigm to provide reliable and efficient approches for uncertain constraint problems. We demonstrate the applicability of the framework on a case study in network diagnosis. We define resolution forms that give generic templates, and their associated operational semantics, to derive practical solution methods for reliable solutions.Comment: Revised versio

Microsimulation models incorporating both demand and supply dynamics

There has been rapid growth in interest in real-time transport strategies over the last decade, ranging from automated highway systems and responsive traffic signal control to incident management and driver information systems. The complexity of these strategies, in terms of the spatial and temporal interactions within the transport system, has led to a parallel growth in the application of traffic microsimulation models for the evaluation and design of such measures, as a remedy to the limitations faced by conventional static, macroscopic approaches. However, while this naturally addresses the immediate impacts of the measure, a difficulty that remains is the question of how the secondary impacts, specifically the effect on route and departure time choice of subsequent trips, may be handled in a consistent manner within a microsimulation framework. The paper describes a modelling approach to road network traffic, in which the emphasis is on the integrated microsimulation of individual trip-makers’ decisions and individual vehicle movements across the network. To achieve this it represents directly individual drivers’ choices and experiences as they evolve from day-to-day, combined with a detailed within-day traffic simulation model of the space–time trajectories of individual vehicles according to car-following and lane-changing rules and intersection regulations. It therefore models both day-to-day and within-day variability in both demand and supply conditions, and so, we believe, is particularly suited for the realistic modelling of real-time strategies such as those listed above. The full model specification is given, along with details of its algorithmic implementation. A number of representative numerical applications are presented, including: sensitivity studies of the impact of day-to-day variability; an application to the evaluation of alternative signal control policies; and the evaluation of the introduction of bus-only lanes in a sub-network of Leeds. Our experience demonstrates that this modelling framework is computationally feasible as a method for providing a fully internally consistent, microscopic, dynamic assignment, incorporating both within- and between-day demand and supply dynamic