Alternative Conditions for a Well-Behaved Travel Time Model
Transportation Science
Convergence of a Discretised Travel-Time Model
Transportation Science
Analysis of Dynamic Traffic Equilibrium with Departure Time Choice
Transportation Science
Delay Modelling at Unsignalized Highway Nodes with Radial Basis Function Neural Networks
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks
A node-based modeling approach for the continuous dynamic network loading problem
IEEE Transactions on Intelligent Transportation Systems
Nash Equilibria and the Price of Anarchy for Flows over Time
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Equilibrium Results for Dynamic Congestion Games
Transportation Science
A trip time model for traffic flow on a semi-closed loop
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
The continuous dynamic network loading problem (CDNLP) consists in determining, on a congested network, time-dependent arc volumes, together with arc and path travel times, given the time-varying path flow departue rates over a finite time horizon. This problem constitutes an intrinsic part of the dynamic traffic assignment problem. In this paper, we present a formulation of the CDNLP where travel delays may be nonlinear functions of arc traffic volumes. We prove, under a boundedness condition, that there exists a unique solution to the problem and propose for its solution a finite-step algorithm. Some computational results are reported for a discretized version of the algorithm.