This paper proposes a novel semi-analytical approach for solving the dynamic user equilibrium (DUE) of a bottleneck model with general heterogeneous users. The proposed approach makes use of the analytical solutions from the bottleneck analysis to create an equivalent assignment problem that...

Extending a recent work (Pang et al., in press) pertaining to a simple single-bottleneck model, this paper is the first of a two-part research wherein we undertake a mathematically rigorous study of the continuous-time dynamic user equilibrium (DUE) problem using the recently introduced...

This paper develops a formulation for the network level dynamic traffic equilibrium model with departure time choice and route choice. The embedded network loading procedure follows the cell transmission model without the holding-back issues by using detailed representations of flows at merges...

In this paper, we consider dynamic congestion pricing in the presence of demand uncertainty. In particular, we apply a robust optimization (RO) approach based on a bi-level cellular particle swarm optimization (BCPSO) to optimal congestion pricing problems when flows correspond to dynamic user...

In this paper we present a continuous-time network loading procedure based on the Lighthill–Whitham–Richards model proposed by Lighthill and Whitham (1955) and Richards (1956). A system of differential algebraic equations (DAEs) is proposed for describing traffic flow propagation, travel...

The family of macroscopic node models which comply to a set of basic requirements is presented and analysed. Such models are required in macro-, mesoscopic traffic flow models, including dynamic network loading models for dynamic traffic assignment. Based on the behaviour of drivers approaching...

Different from traditional methods, this paper formulates the logit-based stochastic dynamic user optimal (SDUO) route choice problem as a fixed point (FP) problem in terms of intersection movement choice probabilities, which contain travelers’ route information so that the realistic effects...

Real-time coordinated traffic management strategies that benefit from parsimonious models with aggregated network dynamics, provide a new generation of smart hierarchical strategies to improve network capacity and performance. However, this raises the question of route choice behavior in case of...

An important class of models for macroscopic dynamic network loading (DNL) and dynamic traffic assignment (DTA) is based on treating link travel times as a function of link occupancy. However, these models suffer from some problems or deficiencies namely (a) the link outflows can violate...

In traffic assignment models with time-varying flows (dynamic network loading or dynamic traffic assignment), overtaking behaviour is normally not included in the model and, in that case, it is important that the model at least approximates first-in–first-out (FIFO), to prevent deviations from...