arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.02033math.OCcs.GTcs.SYeess.SY
收藏

基于网络广义极值模型的马尔可夫交通均衡配流

Markovian Traffic Equilibrium Assignment based on Network Generalized Extreme Value Model

Yuki Oyama, Yusuke Hara, Takashi Akamatsu

摘要:

基于网络广义极值(NGEV)模型建立马尔可夫交通均衡配流模型,称之为NGEV均衡配流。最近提出了使用NGEV模型进行路线选择建模,并且它使得能够在没有明确的路径枚举的情况下捕获路径相关性。然而,该模型在交通分配领域的理论性质尚未在文献中得到研究,这限制了NGEV模型在交通分配领域的实际适用性。本研究通过提供NGEV均衡分配所需的理论发展来解决研究空白。我们首先表明,NGEV分配可以制定和解决传统的马尔可夫交通分配模型相同的路径代数。此外,我们提出了等价的NGEV均衡分配的优化公式。该公式使我们能够得到原始和对偶类型的有效解算法。特别地,该对偶算法基于首次应用于交通分配的加速梯度法。数值实验表明,所提出的原始对偶法具有良好的收敛性和互补关系。

英文摘要:

This study establishes Markovian traffic equilibrium assignment based on the network generalized extreme value (NGEV) model, which we call NGEV equilibrium assignment. The use of the NGEV model for route choice modeling has recently been proposed, and it enables capturing the path correlation without explicit path enumeration. However, the theoretical properties of the model in traffic assignment have yet to be investigated in the literature, which has limited the practical applicability of the NGEV model in the traffic assignment field. This study addresses the research gap by providing the theoretical developments necessary for the NGEV equilibrium assignment. We first show that the NGEV assignment can be formulated and solved under the same path algebra as the traditional Markovian traffic assignment models. Moreover, we present the equivalent optimization formulations to the NGEV equilibrium assignment. The formulations allow us to derive both primal and dual types of efficient solution algorithms. In particular, the dual algorithm is based on the accelerated gradient method that is for the first time applied in the traffic assignment. The numerical experiments showed the excellent convergence and complementary relationship of the proposed primal-dual algorithms.

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

↑