.png){kind=icon}
返回
Queue replacement principle for corridor problems with heterogeneous commuters
.png){kind=icon}
OA
AI
DOI：10.1016/j.trb.2024.103024.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This study investigates the theoretical properties of a departure time choice problem considering commuters' heterogeneity with respect to the value of schedule delay in corridor networks. Specifically, we develop an analytical method to solve the dynamic system optimal (DSO) and dynamic user equilibrium (DUE) problems. To derive the DSO solution, we first demonstrate the bottleneck-based decomposition property, i.e., the DSO problem can be decomposed into multiple single bottleneck problems. Subsequently, we obtain the analytical solution by applying the theory of optimal transport to each decomposed problem and derive optimal congestion prices to achieve the DSO state. To derive the DUE solution, we prove the queue replacement principle (QRP) that the time-varying optimal congestion prices are equal to the queueing delay in the DUE state at every bottleneck. This principle enables us to derive a closed-form DUE solution based on the DSO solution. Moreover, as an application of the QRP, we prove that the equilibrium solution under various policies (e.g., on-ramp metering, on-ramp pricing, and its partial implementation) can be obtained analytically. Finally, we compare these equilibria with the DSO state.
Keyword:
Departure time choice problem
Corridor networks
Heterogeneous value of schedule delay
Dynamic user equilibrium
Dynamic system optimum
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.6K
被引数:
1.9W
机构
引用论文
First-best dynamic assignment of commuters with endogenous heterogeneities in a corridor network
.png){kind=icon}
PREAI
分享收藏分享收藏
查看更多内容