arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.1211math.OC
收藏

具有固定或内生用户容忍度的有限理性动态用户均衡的公式化、存在性和计算

Formulation, existence, and computation of boundedly rational dynamic user equilibrium with fixed or endogenous user tolerance

Ke Han, W. Y. Szeto, Terry L. Friesz

摘要:

本文分析了同时的路线和出发时间(SRDT)的动态用户均衡(DUE),结合有限理性(BR)的概念,在出发时间和路线选择的用户行为。内在地,我们提出的有限理性动态用户均衡(BR-DUE)模型假设,旅行者并不总是寻求成本最低的路线和出发时间的选择。相反,他们对旅行成本的感知受到无差异带的影响,该无差异带描述了旅行者对他们的经验旅行成本和最低旅行成本之间的差异的容忍度。BR-DUE问题的扩展是所谓的可变容差动态用户平衡(VT-BR-DUE),其中内生确定的容差不仅可以取决于路径,还可以取决于所建立的路径偏离率。本文提出了一个统一的方法来建模BR-DUE和VT-BR-DUE,这使得这类问题的模型制定,存在性分析,解的特征,和启发式数值计算的重要贡献。VT-BR-DUE问题和BR-DUE问题作为一种特殊情况,被表示为一个变分不等式.我们提供了一个非常普遍的存在性结果VT-BR-DUE和BR-DUE依赖于弱于单纯的DUE模型所需的假设。此外,基于严格的拓扑分析,提供了一个特征的解集。最后,基于VI和DVI公式提出了三种计算算法。数值研究进行评估所提出的算法的解决方案的质量,收敛性和计算效率。

英文摘要:

This paper analyzes simultaneous route-and-departure-time (SRDT) dynamic user equilibrium (DUE) that incorporates the notion of boundedly rational (BR) user behavior in the selection of departure time and route choices. Intrinsically, the boundedly rational dynamic user equilibrium (BR-DUE) model we present assumes that travelers do not always seek the least costly route-and-departure-time choice. Rather, their perception of travel cost is affected by an indifference band describing travelers' tolerance of the difference between their experienced travel costs and the minimum travel cost. An extension of the BR-DUE problem is the so-called variable tolerance dynamic user equilibrium (VT-BR-DUE) wherein endogenously determined tolerances may depend not only on paths, but also on the established path departure rates. This paper presents a unified approach for modeling both BR-DUE and VT-BR-DUE, which makes significant contributions to model formulation, analysis of existence, solution characterization, and heuristic numerical computation of such problems. The VT-BR-DUE problem, together with the BR-DUE problem as a special case, is formulated as a variational inequality. We provide a very general existence result for VT-BR-DUE and BR-DUE that relies on assumptions weaker than those required for mere DUE models. Moreover, a characterization of the solution set is provided based on rigorous topological analysis. Finally, three computational algorithms are proposed based on the VI and DVI formulations. Numerical studies are conducted to assess the proposed algorithms in terms of solution quality, convergence, and computational efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑