Please use this identifier to cite or link to this item:
|Title:||General stochastic user equilibrium traffic assignment problem with link capacity constraints|
|Authors:||Meng, Q. |
|Keywords:||Lagrangian dual method|
Link capacity constraints
Stochastic user equilibrium
|Source:||Meng, Q.,Lam, W.H.K.,Yang, L. (2008). General stochastic user equilibrium traffic assignment problem with link capacity constraints. Journal of Advanced Transportation 42 (4) : 429-465. ScholarBank@NUS Repository.|
|Abstract:||This paper addresses a general stochastic user equilibrium (SUE) traffic assignment problem with link capacity constraints. It first proposes a novel linearly constrained minimization model in terms of path flows and then shows that any of its local minimums satisfies the generalized SUE conditions. As the objective function of the proposed model involves path-specific delay functions without explicit mathematical expressions, its Lagrangian dual formulation is analyzed. On the basis of the Lagrangian dual model, a convergent Lagrangian dual method with a predetermined step size sequence is developed. This solution method merely invokes a subroutine at each iteration to perform a conventional SUE traffic assignment excluding link capacity constraints. Finally, two numerical examples are used to illustrate the proposed model and solution method.|
|Source Title:||Journal of Advanced Transportation|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.