TY - JOUR
T1 - A partial differential equation formulation of Vickrey's bottleneck model, part II
T2 - Numerical analysis and computation
AU - Han, Ke
AU - Friesz, Terry L.
AU - Yao, Tao
N1 - Funding Information:
This work was partially supported by NSF through Grant EFRI-1024707, “A theory of complex transportation network design”.
PY - 2013/3
Y1 - 2013/3
N2 - The Vickrey model, originally introduced in Vickrey (1969), is one of the most widely used link-based models in the current literature in dynamic traffic assignment (DTA). One popular formulation of this model is an ordinary differential equation (ODE) that is discontinuous with respect to its state variable. As explained in Ban et al. (2011) and Han et al. (2013), such an irregularity induces difficulties in both continuous-time analysis and discrete-time computation. In Han et al. (2013), the authors proposed a reformulation of the Vickrey model as a partial differential equation (PDE) and derived a closed-form solution to the aforementioned ODE. This reformulation enables us to rigorously prove analytical properties of the Vickrey model and related DTA models. In this paper, we present the second of a two-part exploration regarding the PDE formulation of the Vickrey model. As proposed by Han et al. (2013), we continue research on the generalized Vickrey model (GVM) in a discrete-time framework and in the context of DTA by presenting a highly computable solution methodology. Our new computational scheme for the GVM is based on the closed-form solution mentioned above. Unlike finite-difference discretization schemes which could yield non-physical solutions (Ban et al., 2011), the proposed numerical scheme guarantees non-negativity of the queue size and the exit flow as well as first-in-first-out (FIFO). Numerical errors and convergence of the computed solutions are investigated in full mathematical rigor. As an application of the GVM, a class of network system optimal dynamic traffic assignment (SO-DTA) problems is analyzed. We show existence of a continuous-time optimal solution and propose a discrete-time mixed integer linear program (MILP) as an approximation to the original SO-DTA. We also provide convergence results for the proposed MILP approximation.
AB - The Vickrey model, originally introduced in Vickrey (1969), is one of the most widely used link-based models in the current literature in dynamic traffic assignment (DTA). One popular formulation of this model is an ordinary differential equation (ODE) that is discontinuous with respect to its state variable. As explained in Ban et al. (2011) and Han et al. (2013), such an irregularity induces difficulties in both continuous-time analysis and discrete-time computation. In Han et al. (2013), the authors proposed a reformulation of the Vickrey model as a partial differential equation (PDE) and derived a closed-form solution to the aforementioned ODE. This reformulation enables us to rigorously prove analytical properties of the Vickrey model and related DTA models. In this paper, we present the second of a two-part exploration regarding the PDE formulation of the Vickrey model. As proposed by Han et al. (2013), we continue research on the generalized Vickrey model (GVM) in a discrete-time framework and in the context of DTA by presenting a highly computable solution methodology. Our new computational scheme for the GVM is based on the closed-form solution mentioned above. Unlike finite-difference discretization schemes which could yield non-physical solutions (Ban et al., 2011), the proposed numerical scheme guarantees non-negativity of the queue size and the exit flow as well as first-in-first-out (FIFO). Numerical errors and convergence of the computed solutions are investigated in full mathematical rigor. As an application of the GVM, a class of network system optimal dynamic traffic assignment (SO-DTA) problems is analyzed. We show existence of a continuous-time optimal solution and propose a discrete-time mixed integer linear program (MILP) as an approximation to the original SO-DTA. We also provide convergence results for the proposed MILP approximation.
UR - http://www.scopus.com/inward/record.url?scp=84875212005&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875212005&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2012.10.004
DO - 10.1016/j.trb.2012.10.004
M3 - Article
AN - SCOPUS:84875212005
SN - 0191-2615
VL - 49
SP - 75
EP - 93
JO - Transportation Research Part B: Methodological
JF - Transportation Research Part B: Methodological
ER -