Unconstrained weibit stochastic user equilibrium model with extensions
Unconstrained weibit stochastic user equilibrium model with extensions
复制标题
DOI：
10.1016/j.trb.2013.10.010
复制
发表时间：
2014
影响因子：
6.8
通讯作者：
S. Kitthamkesorn;A. Chen
中科院分区：
文献类型：
--
作者：
S. Kitthamkesorn;A. Chen
本研究提供了一个无约束的最小化程序作为替代配方的多项式weibit（MNW）的随机用户平衡（SUE）模型，明确考虑了异质感知方差相对于不同的行程长度在拥挤的条件下。给出了无约束最小化规划的定性性质，建立了MNW-SUE解的等价性和唯一性。无约束最小化规划公式的优点是，它允许开发一个基于链接的算法，这避免了路径存储和枚举。方法的贡献在于推导出的预期感知的旅行成本（或满意度函数），使开发的无约束的MNW-SUE最小化程序和基于链接的随机加载机制结合线搜索策略的最新进展，在基于链接的算法。最后通过数值算例说明了MNW-SUE模型和基于链路的算法的特点，并对算法进行了沿着扩展，以供进一步研究。
This study provides an unconstrained minimization program as an alternative formulation for the multinomial weibit (MNW) stochastic user equilibrium (SUE) model that explicitly considers theheterogeneousperception variances with respect to different trip lengths under congested conditions. Qualitative properties of the unconstrained minimization program are given to establish the equivalency and uniqueness of the MNW-SUE solution. The advantage of the unconstrained minimization programming formulation is that it allows the development of a link-based algorithm, which obviates path storage and enumeration. The methodological contributions lie in the derivation of the expected perceived travel cost (or the satisfaction function) that enables the development of an unconstrained MNW-SUE minimization program and a link-based stochastic loading mechanism combined with recent advances in line search strategies in the link-based algorithm. Numerical examples are also provided to illustrate the features of the MNW-SUE model and the link-based algorithm along with several extensions for future research.