2022
DOI: 10.1038/s43588-022-00318-w
|View full text |Cite
|
Sign up to set email alerts
|

Demand-driven design of bicycle infrastructure networks for improved urban bikeability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 40 publications
(55 reference statements)
0
4
0
Order By: Relevance
“…This advancement would serve as a valuable complement to the current static and coarse-grained mapping of world populations 56,57 . By providing a more nuanced understanding of urban mobility patterns, DeepMobility will be instrumental in supporting the development of sustainable and livable cities worldwide [58][59][60] .…”
Section: Discussionmentioning
confidence: 99%
“…This advancement would serve as a valuable complement to the current static and coarse-grained mapping of world populations 56,57 . By providing a more nuanced understanding of urban mobility patterns, DeepMobility will be instrumental in supporting the development of sustainable and livable cities worldwide [58][59][60] .…”
Section: Discussionmentioning
confidence: 99%
“…Note that the graph considered in this work shares some similarities with the one presented in [15], in which a preference graph is considered. There, the weight of each edge depends on a combination of various factors, which however are assumed to be known or measurable.…”
Section: B Statement Of Contributionmentioning
confidence: 99%
“…Note that the barycenters are computed by taking into account both the weights and their probability, that is, for a given cluster P c ⊂ P t , its barycenter is b c = ∑ p∈P c α P t p p. The collection of weights is thus reduced from P t to B, and B is employed to initialize the reduced collection of weights P * (line 12). In the final part of the algorithm, taking into account Proposition 2.6 and the need for a combinatorial search in the neighborhood of the weights, we try to refine each member of P * through a local search (For loop at lines [13][14][15][16][17]. For each p ℓ ∈ P * a search radius ρ is initialized with the radius of the corresponding cluster (line 14).…”
Section: Algorithmmentioning
confidence: 99%
“…Adequate infrastructure is typically lacking, as is the collection and provision of data on bicycle infrastructure, which is necessary to harness the potential of data-driven bicycle network planning. Recent advances demonstrate that quantitative analyses of bicycle infrastructure on the network level can assist planning decisions and considerably improve the impact of planned investments (Natera Orozco et al, 2020;Olmos et al, 2020;Steinacker et al, 2022;Szell et al, 2022;Vybornova et al, 2022), but the necessary precondition of readily available and complete bicycle infrastructure data is typically not fulfilled. Moreover, even when such data are available, there is often little knowledge on data quality.…”
Section: Introductionmentioning
confidence: 99%