双向链接的行人路径网络交通分配问题
Traffic Assignment Problem for Footpath Networks with Bidirectional Links
AI总结：
本文提出了一种基于宏观用户均衡的行人交通分配框架，考虑了双向流的自组织性和随机步行时间，通过校准不同类型的行人流量-延迟函数，验证了该框架在不同规模网络中的有效性。
摘要：
在城市区域中估计行人交通量通常使用计算密集的微观模型，但这些模型在大规模行人路径网络中往往存在可扩展性问题。本文提出了一种新的宏观用户均衡交通分配问题（UE-pTAP）框架，用于行人网络，同时考虑了基本微观特性，如双向流中的自组织性和随机步行旅行时间。我们提出了四种不同类型的行人流量-延迟函数（pVDFs），并用实证数据校准它们，并讨论了它们对交通分配解决方案存在性和唯一性的影响。我们展示了所开发的UE-pTAP框架在小型网络以及悉尼行人路径大规模网络中的适用性。
英文摘要：
The estimation of pedestrian traffic in urban areas is often performed with computationally intensive microscopic models that usually suffer from scalability issues in large-scale footpath networks. In this study, we present a new macroscopic user equilibrium traffic assignment problem (UE-pTAP) framework for pedestrian networks while taking into account fundamental microscopic properties such as self-organization in bidirectional streams and stochastic walking travel times. We propose four different types of pedestrian volume-delay functions (pVDFs), calibrate them with empirical data, and discuss their implications on the existence and uniqueness of the traffic assignment solution. We demonstrate the applicability of the developed UE-pTAP framework in a small network as well as a large scale network of Sydney footpaths.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
