Search results

This paper attempts to assess the parking reliability with taking into account drivers' travel choice behaviors under various traffic conditions. Apart from the well-known travel-time reliability, a parking reliability is newly defined as the probability that the drivers' average searching time for parking is less than a given threshold. This is particularly important under conditions of shortage of parking spaces in urban areas. A Monte Carlo simulation approach, which incorporates a combined trip distribution and assignment model with explicit elastic demand function, is proposed to estimate the two reliability measures of road network (i.e. travel-time and parking reliabilities). A numerical example is used to illustrate the applications of the reliability measures and the proposed approach.

This paper attempts to assess the transit service reliability with taking into account the interaction between network performance and passengers' travel choice behaviors. Besides the well-known schedule reliability, a waiting-time reliability is newly defined as the probability that the passengers' average waiting time is less than a given threshold. A Monte Carlo simulation approach, which incorporates a stochastic user equilibrium transit assignment model with explicit capacity constraints and elastic frequencies, is proposed to estimate the above two reliability measures of transit service. A numerical example is used to illustrate the applicability of the reliability measures and the proposed approach.

This paper describes and extends the game theoretic approach to network vulnerability assessment. The basic idea is to set up a game between the network users who are trying to minimise their expected travel time by choice of route and a network tester who is trying to penalise the users most by degrading a link through capacity reduction leading to congestion. The method therefore finds the worst possible location for a link degradation, taking re-routing options into account (an upper, lower bound of impact). The original game identifies the weakest link for routes between an OD pair in the network. Two variations are introduced in this paper in order to determine the weak links for a specific origin or a specific destination and for the whole network. All three game variations are tested on a small network in Leicester and the results are presented.