Please use this identifier to cite or link to this item:
|Title:||Transportation network optimization problems with stochastic user equilibrium constraints|
|Authors:||Meng, Q. |
|Source:||Meng, Q.,Lee, D.-H.,Yang, H.,Huang, H.-J. (2004). Transportation network optimization problems with stochastic user equilibrium constraints. Transportation Research Record (1882) : 113-119. ScholarBank@NUS Repository.|
|Abstract:||A comprehensive study of static transportation network optimization problems with stochastic user equilibrium constraints is presented. It is explicitly demonstrated that the formulation of the fixed-point problem-in terms of link flows for the general stochastic user equilibrium problem in which the Jacobian matrix of link travel cost functions may not be symmetric - possesses a unique solution with mild conditions. By developing a sensitivity analysis method for the stochastic user equilibrium problem, the study proves that the perturbed equilibrium link flows are continuously differentiable implicit functions with respect to perturbation parameters. Accordingly, it can be concluded that the proposed unified bilevel programming model, which can characterize transportation network optimization problems subject to stochastic user equilibrium constraints, is a smooth optimization problem. In addition, the study presents a single-level continuously differentiable optimization formulation that is equivalent to the unified bilevel programming model. Furthermore, as a unified solution method, a successive quadratic programming algorithm based on the sensitivity analysis method is used to solve the transportation network optimization problems with stochastic user equilibrium constraints. Finally, two examples are used to demonstrate the proposed models and algorithm.|
|Source Title:||Transportation Research Record|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.