交通网络增长中直达性与覆盖范围之间的权衡
The Trade-Off between Directness and Coverage in Transport Network Growth
AI总结:
本文系统比较了交通网络增长中随机、贪婪和人工设计策略在直达性与覆盖范围上的表现,发现两者存在非平凡权衡,手动策略最优,随机策略最差,并揭示了不同贪婪策略的适用条件与局限。
摘要:
设计空间网络(如交通网络)通常面临如何通过一组链路最佳连接一组位置的问题。在实践中,以促进网络在增长过程中尽早发挥功能的方式安排链路的实施顺序可能至关重要,例如在自行车网络中。然而,目前尚不清楚不同的增长过程如何实现这种早期功能结构。在此,我们系统地研究了连通平面网络的增长,量化了增长中网络结构的功能性。我们将随机增长与各种贪婪策略和人工设计的手动增长策略进行比较。我们通过直达性和覆盖范围这两个基本性能指标来评估结果,发现它们之间存在非平凡的权衡。手动策略在这两个指标上均优于贪婪策略,而随机策略表现最差,且不太可能具有帕累托效率。基于中心性的贪婪策略往往在直达性方面表现最佳,但在覆盖范围方面比随机策略更差;而基于覆盖范围的贪婪策略能够尽可能快地实现最大全局覆盖,但在直达性方面与随机策略一样表现不佳。基于直达性的贪婪策略会陷入局部最优陷阱。这些结果适用于多种典型城市交通网络拓扑。我们的见解对于链路添加到空间网络的顺序很重要的应用至关重要,例如城市或区域交通网络设计问题。
英文摘要:
Designing spatial networks, such as transport networks, commonly deals with the problem of how to best connect a set of locations through a set of links. In practice, it can be crucial to order the implementation of the links in a way that facilitates early functioning of the network during growth, like in bicycle networks. However, it is unclear how this early functional structure can be achieved by different growth processes. Here, we systematically study the growth of connected planar networks, quantifying functionality of the growing network structure. We compare random growth with various greedy and human-designed, manual growth strategies. We evaluate our results via the fundamental performance metrics of directness and coverage, finding non-trivial trade-offs between them. Manual strategies fare better than greedy strategies on both metrics, while random strategies perform worst and are unlikely to be Pareto efficient. Centrality-based greedy strategies tend to perform best for directness but are worse than random strategies for coverage, while coverage-based greedy strategies can achieve maximum global coverage as fast as possible but perform as poorly for directness as random strategies. Directness-based greedy strategies get stuck in local optimum traps. These results hold for a number of stylized urban transport network topologies. Our insights are crucial for applications where the order in which links are added to a spatial network is important, such as in urban or regional transport network design problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。