马尔可夫交通均衡下交通网络最优收费的参数估计
Parameter Estimation in Optimal Tolling for Traffic Networks Under the Markovian Traffic Equilibrium
AI总结:
本文针对交通网络最优收费问题,提出一种在线学习算法,在基于弧的交通分配模型中同时估计线性弧延迟函数与熵参数 β 并实施收费,证明其遗憾上界为 O(√T ln(T) |A| max{|N| ln(|A|/|N|), B}),并通过模拟实验验证了理论结果。
摘要:
收费(或称拥堵定价)已成为防止交通系统拥堵的有效工具。然而,当前收费方案大多基于路径型交通分配模型(TAM)设计,这类模型可能不切实际且计算开销高昂。现有方法还不切实际地假设中央收费机构能够获取描述网络中每条弧(边)通行时间的延迟函数参数,以及刻画通勤者在网络上随机弧选择决策的熵参数 β。为解决这些问题,本文构建了一种在线学习算法,该算法在基于弧的交通分配模型中同时细化线性弧延迟函数和熵参数的估计,并在每条弧上实施收费以诱导均衡流量,从而最小化网络整体拥堵。我们证明该算法的遗憾上界为 O(√T ln(T) |A| max{|N| ln(|A|/|N|), B}),其中 T 表示总迭代次数,|A| 和 |N| 分别表示网络中弧和节点的总数,B 描述构建 β 估计所需的弧数(通常远小于 |I|)。最后,我们给出了在模拟交通网络上的数值结果,验证了理论贡献。
英文摘要:
Tolling, or congestion pricing, has emerged as an effective tool for preventing gridlock in traffic systems. However, tolls are currently mostly designed on route-based traffic assignment models (TAM), which may be unrealistic and computationally expensive. Existing approaches also impractically assume that the central tolling authority can access latency function parameters that characterize the time required to traverse each network arc (edge), as well as the entropy parameter $β$ that characterizes commuters' stochastic arc-selection decisions on the network. To address these issues, this work formulates an online learning algorithm that simultaneously refines estimates of linear arc latency functions and entropy parameters in an arc-based TAM, while implementing tolls on each arc to induce equilibrium flows that minimize overall congestion on the network. We prove that our algorithm incurs regret upper bounded by $O(\sqrt{T} \ln(T) |\arcsMod| \max\{|\nodesMod| \ln(|\arcsMod|/|\nodesMod|), B \})$, where $T$ denotes the total iteration count, $|\arcsMod|$ and $|\nodesMod|$ denote the total number of arcs and nodes in the network, respectively, and $B$ describes the number of arcs required to construct an estimate of $β$ (usually $\ll |I|$). Finally, we present numerical results on simulated traffic networks that validate our theoretical contributions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。