走廊网络中的动态交通分配：最优与均衡
Dynamic traffic assignment in a corridor network: Optimum versus Equilibrium
AI总结：
本研究探讨了走廊网络中早晚通勤的动态系统最优与动态用户均衡交通分配问题，提出了一种推导两者闭式解的新方法，并揭示了DUE排队延迟与DSO最优收费之间的理论等价关系。
摘要：
本研究调查了走廊网络中出发/到达时间选择的动态系统最优（DSO）和动态用户均衡（DUE）交通分配。考虑了具有一对多（多对一）起讫点需求模式的早晨通勤问题和具有一对多模式（一对多）的晚间通勤问题。具体而言，开发了一种为DSO和DUE问题推导闭式解的新方法。我们首先基于最优状态下成本和流变量的规律性推导出DSO问题的闭式解。利用该解，我们证明了在日程延迟函数的特定条件下，DUE解中瓶颈处的排队延迟等于DSO解中消除排队的最优收费。这使我们能够利用DSO解推导出闭式DUE解。我们还展示了DSO和DUE分配之间的理论关系。提供了数值示例以说明和验证分析结果。
英文摘要：
This study investigates dynamic system-optimal (DSO) and dynamic user equilibrium (DUE) traffic assignment of departure/arrival-time choices in a corridor network. The morning commute problems with a many-to-one pattern of origin-destination demand and the evening commute problems with a one-to-many pattern are considered. Specifically, a novel approach to derive closed-form solutions for both DSO and DUE problems is developed. We first derive a closed-form solution to the DSO problem based on the regularities of the cost and flow variables at an optimal state. By utilizing this solution, we prove that the queuing delay at a bottleneck in a DUE solution is equal to an optimal toll that eliminates the queue in a DSO solution under certain conditions of a schedule delay function. This enables us to derive a closed-form DUE solution by using the DSO solution. We also show the theoretical relationship between the DSO and DUE assignment. Numerical examples are provided to illustrate and verify the analytical results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
