Automated Detection of Missing Links in Bicycle Networks

• URL: http://arxiv.org/abs/2201.03402v2
• Date: Mon, 28 Mar 2022 08:29:29 GMT
• Title: Automated Detection of Missing Links in Bicycle Networks
• Authors: Anastassia Vybornova, Tiago Cunha, Astrid G\"uhnemann and Michael Szell
• Abstract summary: We develop the IPDC procedure (Identify, Prioritize, Decluster, Classify) for finding the most important missing links in urban bicycle networks. We first identify all possible gaps following a multiplex network approach, prioritize them according to a flow-based metric, decluster emerging gap clusters, and manually classify the types of gaps. Our results show how network analysis with minimal data requirements can serve as a cost-efficient support tool for bicycle network planning.
• Score: 0.15293427903448023
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cycling is an effective solution for making urban transport more sustainable. However, bicycle networks are typically developed in a slow, piecewise process that leaves open a large number of gaps, even in well developed cycling cities like Copenhagen. Here, we develop the IPDC procedure (Identify, Prioritize, Decluster, Classify) for finding the most important missing links in urban bicycle networks, using data from OpenStreetMap. In this procedure we first identify all possible gaps following a multiplex network approach, prioritize them according to a flow-based metric, decluster emerging gap clusters, and manually classify the types of gaps. We apply the IPDC procedure to Copenhagen and report the 105 top priority gaps. For evaluation, we compare these gaps with the city's most recent Cycle Path Prioritization Plan and find considerable overlaps. Our results show how network analysis with minimal data requirements can serve as a cost-efficient support tool for bicycle network planning. By taking into account the whole city network for consolidating urban bicycle infrastructure, our data-driven framework can complement localized, manual planning processes for more effective, city-wide decision-making.

Related papers

• Classifying Bicycle Infrastructure Using On-Bike Street-Level Images [0.0]
  Many potential cyclists are discouraged from taking up cycling due to the lack of suitable and safe infrastructure. We propose a system capable of classifying available cycling infrastructure from on-bike smartphone camera data. This work is the first to classify cycling infrastructure using only street-level imagery collected from bike-mounted mobile phone cameras.
  arXiv  Detail & Related papers  (2024-10-24T22:58:31Z)
• Evaluating the effects of Data Sparsity on the Link-level Bicycling Volume Estimation: A Graph Convolutional Neural Network Approach [54.84957282120537]
  We present the first study to utilize a Graph Convolutional Network architecture to model link-level bicycling volumes. We estimate the Annual Average Daily Bicycle (AADB) counts across the City of Melbourne, Australia using Strava Metro bicycling count data. Our results show that the GCN model performs better than these traditional models in predicting AADB counts.
  arXiv  Detail & Related papers  (2024-10-11T04:53:18Z)
• BikeDNA: A Tool for Bicycle Infrastructure Data & Network Assessment [0.0]
  BikeDNA is an open-source tool for reproducible quality assessment of bicycle infrastructure data. BikeDNA supports quality assessments of bicycle infrastructure data for a wide range of applications.
  arXiv  Detail & Related papers  (2023-03-02T13:06:59Z)
• Predicting Citi Bike Demand Evolution Using Dynamic Graphs [81.12174591442479]
  We apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset. In this paper, we attempt to apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset.
  arXiv  Detail & Related papers  (2022-12-18T21:43:27Z)
• Improving short-term bike sharing demand forecast through an irregular convolutional neural network [16.688608586485316]
  The study proposes an irregular convolutional Long-Short Term Memory model (IrConv+LSTM) to improve short-term bike sharing demand forecast. The proposed model is evaluated with a set of benchmark models in five study sites, which include one dockless bike sharing system in Singapore, and four station-based systems in Chicago, Washington, D.C., New York, and London. The model also achieves superior performance in areas with varying levels of bicycle usage and during peak periods.
  arXiv  Detail & Related papers  (2022-02-09T10:21:45Z)
• A Cluster-Based Trip Prediction Graph Neural Network Model for Bike Sharing Systems [2.1423963702744597]
  Bike Sharing Systems (BSSs) are emerging as an innovative transportation service. Ensuring the proper functioning of a BSS is crucial given that these systems are committed to eradicating many of the current global concerns. Good knowledge of users' transition patterns is a decisive contribution to the quality and operability of the service.
  arXiv  Detail & Related papers  (2022-01-03T15:47:40Z)
• Growing Urban Bicycle Networks [0.755972004983746]
  We study different variations of growing a synthetic bicycle network between an arbitrary set of points routed on the urban street network. We find initially decreasing returns on investment until a critical threshold, posing fundamental consequences to sustainable urban planning. We also find pronounced overlaps of synthetically grown networks in cities with well-developed existing bicycle networks, showing that our model reflects reality.
  arXiv  Detail & Related papers  (2021-07-05T18:00:04Z)
• Optimal transport in multilayer networks [68.8204255655161]
  We propose a model where optimal flows on different layers contribute differently to the total cost to be minimized. As an application, we consider transportation networks, where each layer is associated to a different transportation system. We show an example of this result on the real 2-layer network of the city of Bordeaux with bus and tram, where in certain regimes the presence of the tram network significantly unburdens the traffic on the road network.
  arXiv  Detail & Related papers  (2021-06-14T07:33:09Z)
• Dynamic Bicycle Dispatching of Dockless Public Bicycle-sharing Systems using Multi-objective Reinforcement Learning [79.61517670541863]
  How to use AI to provide efficient bicycle dispatching solutions based on dynamic bicycle rental demand is an essential issue for dockless PBS (DL-PBS) We propose a dynamic bicycle dispatching algorithm based on multi-objective reinforcement learning (MORL-BD) to provide the optimal bicycle dispatching solution for DL-PBS.
  arXiv  Detail & Related papers  (2021-01-19T03:09:51Z)
• Dynamic Planning of Bicycle Stations in Dockless Public Bicycle-sharing System Using Gated Graph Neural Network [79.61517670541863]
  Dockless Public Bicycle-sharing (DL-PBS) network becomes increasingly popular in many countries. redundant and low-utility stations waste public urban space and maintenance costs of DL-PBS vendors. We propose a Bicycle Station Dynamic Planning (BSDP) system to dynamically provide the optimal bicycle station layout for the DL-PBS network.
  arXiv  Detail & Related papers  (2021-01-19T02:51:12Z)
• Multi-Agent Routing Value Iteration Network [88.38796921838203]
  We propose a graph neural network based model that is able to perform multi-agent routing based on learned value in a sparsely connected graph. We show that our model trained with only two agents on graphs with a maximum of 25 nodes can easily generalize to situations with more agents and/or nodes.
  arXiv  Detail & Related papers  (2020-07-09T22:16:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.