This paper proposes a simultaneous route and departure time choice (SRDTC) problem with fixed demand in a degradable transport network. In this network, travelers face with stochastic travel times. Their selection of routes and departure times follows the UE principle in terms of the mean generalized route cost, which is defined as the probabilistic dynamic user optimal (PDUO) principle. The proposed PDUO-SRDTC problem is formulated as a variational inequality (VI) problem. As a special case of PDUO-SRDTC problem, the PDUO route choice (PDUO-RC) problem is also proposed and formulated as a VI problem. Network degradation is defined on the degradation of the outflow capacity of each link. A Monte Carlo-based stochastic link transmission model (MC-SLTM) is developed to capture the effect of physical queues and the random evolution of traffic states during flow propagation to estimate mean generalized route costs. Both the extragradient algorithm and the route-swapping method with a variable sample size scheme are developed to solve the proposed VI problems. Numerical examples are developed to illustrate the paradoxical phenomena of the problems and the effectiveness of the solution methods. Numerical results show that constructing a new road, enhancing link outflow capacity, or reducing outflow capacity degradation can lead to poor network performance and it is important to consider both network degradation and queue spillback when making transportation policies aimed at improving network performance. The results also demonstrate that the variable sample size scheme can give a quicker and better solution than the traditional fixed sample size scheme.
Dynamic traffic assignment in degradable networks: paradoxes and formulations with stochastic link transmission model
Transportmetrica B: Transport Dynamics ; 7 , 1 ; 336-362
2019-12-23
27 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks
Online Contents | 2003
|Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks
British Library Online Contents | 2003
|Stochastic and deterministic formulations of dynamic traffic assignment
British Library Conference Proceedings | 1997
|