Submission to the DTA2012 Special Issue: Convergence of Time Discretization Schemes for Continuous-Time Dynamic Network Loading Models.

Ma, Rui; Ban, Xuegang; Pang, Jong-Shi; Liu, Henry

Dynamic Network Loading (DNL) is an essential component of Dynamic Traffic Assignment (DTA) and Dynamic User Equilibrium (DUE). Most DNL models are formulated in continuous time but solved in discrete time to obtain numerical solutions. This paper discusses the importance of choosing proper discretization schemes to numerically solve continuous-time DNL models and further to obtain convergence and other desirable properties of the discretization schemes. We use the recently developed α point-queue model as an example. We first develop theoretical results to prove the consistency, stability and convergence of the implicit and explicit discretization schemes for solving the α point-queue model. We then conduct numerical experiments to show such results accordingly. We also discuss the implications of the implicit and explicit discretization schemes to the developments of DNL and DTA/DUE solution algorithms.

TRAFFIC assignment; STOCHASTIC convergence; DISCRETIZATION methods; CONTINUOUS time systems; DYNAMIC models; ALGORITHMS

Networks & Spatial Economics, 2015, Vol 15, Issue 3, p419

1566-113X

Academic Journal

10.1007/s11067-014-9239-5