ABSTRACTIn this article, we propose a new model called subjective-utility travel time budget (SU-TTB) model to capture travelers' risk-averse route choices. In the travel time budget (TTB) and mean-excess travel time (METT) model, a predefined confidence level is needed to capture the risk-aversion in route choice. Due to the day-to-day route travel time variations, the exact confidence level is hard to be predicted. With the SU-TTB model, we assume travelers' confidence level belongs to an interval that they may comply with in the route choice. The two main components of SU-TTB are the utility function and the TTB model. We can show that the SU-TTB can be reduced to the TTB and METT model with proper utility function for the confidence levels. We can also prove its equivalence with our recently proposed nonlinear-expectation route travel time (NERTT) model in some cases and give some new interpretation on the NERTT with this equivalence. Finally, we formulate the SU-TTB model as a variational inequality (VI) problem to model the risk-averse user equilibrium (RAUE), termed as generalized RAUE (GRAUE). The GRAUE is solved via a heuristic gradient projection algorithm, and the model and solution algorithm are demonstrated with the Braess's traffic network and the Nguyen and Dupuis's traffic network. 相似文献
ABSTRACTThe deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes.The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models. 相似文献
A new regularisation of non-elliptical contact patches has been introduced, which enables building the look-up table called by us the Kalker book of tables for non-Hertzian contact (KBTNH), which is a fast creep force generator that can be used by multibody dynamics system simulation programs. The non-elliptical contact patch is regularised by a simple double-elliptical contact region (SDEC). The SDEC region is especially suitable for regularisation of contact patches obtained with approximate non-Hertzian methods for solving the normal contact problem of wheel and rail. The new regularisation is suitable for wheels and rails with any profiles, including worn profiles.
The paper describes the new procedure of regularisation of the non-elliptical contact patch, the structure of the Kalker book of tables, and parameterisation of the independent variables of the tables and creep forces.
A moderate volume Kalker book of tables for SDEC region suitable for simulation of modern running gears has been computed in co-simulation of Matlab and program CONTACT.
To access the creep forces of the Kalker book of tables, the linear interpolation has been applied.
The creep forces obtained from KBTNH have been compared to those obtained by program CONTACT and FASTSIM algorithm. FASTSIM has been applied on both the contact ellipse and the SDEC contact patch. The comparison shows that KBTNH is in good agreement with CONTACT for a wide range of creepage condition and shapes of the contact patch, whereas the use of FASTSIM on the elliptical patch and SDEC may lead to significant deviations from the reference CONTACT solutions.
The computational cost of calling creep forces from KBTNH has been estimated by comparing CPU time of FASTSIM and KBTNH. The KBTNH is 7.8–51 times faster than FASTSIM working on 36–256 discretisation elements, respectively.
In the example of application, the KBTNH has been applied for curving simulations and results compared with those obtained with the creep force generator employing the elliptical regularisation. The results significantly differ, especially in predicted creepages, because the elliptical regularisation neglects generation of the longitudinal creep force by spin creepage. 相似文献