arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.07080physics.soc-phcs.CYcs.SI
收藏

数据驱动的最佳自行车网络增长策略

Data-driven strategies for optimal bicycle network growth

Luis Natera, Federico Battiston, Gerardo Iñiguez, Michael Szell

摘要:

城市交通网络,从人行道和自行车道到街道和铁路线,为城市的运动和社会经济生活提供了支柱。这些网络可以被理解为更大的多路复用传输网络的层。由于大多数城市都是以汽车为中心的,因此最发达的图层通常是街道图层,而其他图层可能高度断开。为了使城市交通可持续发展,城市越来越多地投资发展自行车网络。然而,考虑到自行车网络层通常是不完整的,目前还不清楚如何在有限的预算下全面有效地扩展它。在这里,我们开发了数据驱动的算法网络增长策略,并将其应用于世界各地的城市,表明小而集中的投资可以显着提高城市自行车网络的连通性和直接性。我们激励我们的算法与网络组件分析和多模态城市指纹,揭示不同类别的城市取决于不同的网络层之间的连通性的发展。我们引入了两个贪婪算法来添加自行车层中最关键的缺失链接:第一个算法连接两个最大的连接组件,第二个算法连接最大的与最近的组件。我们表明,这些算法都胜过随机方法和基线最小投资策略,连接最接近的组件忽略大小。我们的计算方法通过利用城市范围内的城市数据,概述了从以汽车为中心到可持续城市的新途径。这是对自行车基础设施发展进行量化整合的第一步,对城市规划者和利益相关者来说是有价值的。

英文摘要:

Urban transportation networks, from sidewalks and bicycle paths to streets and rail lines, provide the backbone for movement and socioeconomic life in cities. These networks can be understood as layers of a larger multiplex transport network. Because most cities are car-centric, the most developed layer is typically the street layer, while other layers can be highly disconnected. To make urban transport sustainable, cities are increasingly investing to develop their bicycle networks. However, given the usually patchy nature of the bicycle network layer, it is yet unclear how to extend it comprehensively and effectively given a limited budget. Here we develop data-driven, algorithmic network growth strategies and apply them to cities around the world, showing that small but focused investments allow to significantly increase the connectedness and directness of urban bicycle networks. We motivate the development of our algorithms with a network component analysis and with multimodal urban fingerprints that reveal different classes of cities depending on the connectedness between different network layers. We introduce two greedy algorithms to add the most critical missing links in the bicycle layer: The first algorithm connects the two largest connected components, the second algorithm connects the largest with the closest component. We show that these algorithms outmatch both a random approach and a baseline minimum investment strategy that connects the closest components ignoring size. Our computational approach outlines novel pathways from car-centric towards sustainable cities by taking advantage of urban data available on a city-wide scale. It is a first step towards a quantitative consolidation of bicycle infrastructure development that can become valuable for urban planners and stakeholders.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑