How much longer do you have to drive than the crow has to fly?

Abstract When travelling by car from one location to another, our route is constrained by the road network. The network distance between the two locations is generally longer than the geodetic distance as the crow flies. We report a systematic relation between the statistical properties of these two distances. Empirically, we find a robust scaling between network and geodetic distance distributions for a variety of large motorway networks. A simple consequence is that we typically have to drive 1.3 ± 0.1 times longer than the crow flies. This scaling is not present in standard random networks; rather, it requires non-random adjacency. We develop a set of rules to build a realistic motorway network, also consistent with the above scaling. We hypothesise that the scaling reflects a compromise between two societal needs: high efficiency and accessibility on the one hand, and limitation of costs and other burdens on the other.

Authors

Institutions

Publication Details

Journal
npj Complexity
Published
2024-12-12
DOI
https://doi.org/10.1038/s44260-024-00023-x
Citations
2
Primary Topic
Urban Transport and Accessibility
Type
article
Field-Weighted Citation Impact
1.37

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

How much longer do you have to drive than the crow has to fly?

Michael Schreckenberg, Thomas Guhr, Henrik M. Bette, Shanshan Wang
2 citations
npj Complexity
Urban Transport and Accessibility
1.37
article

How much longer do you have to drive than the crow has to fly?

Michael Schreckenberg, Thomas Guhr, Henrik M. Bette, Shanshan Wang
article en
2 citations

Abstract

Abstract When travelling by car from one location to another, our route is constrained by the road network. The network distance between the two locations is generally longer than the geodetic distance as the crow flies. We report a systematic relation between the statistical properties of these two distances. Empirically, we find a robust scaling between network and geodetic distance distributions for a variety of large motorway networks. A simple consequence is that we typically have to drive 1.3 ± 0.1 times longer than the crow flies. This scaling is not present in standard random networks; rather, it requires non-random adjacency. We develop a set of rules to build a realistic motorway network, also consistent with the above scaling. We hypothesise that the scaling reflects a compromise between two societal needs: high efficiency and accessibility on the one hand, and limitation of costs and other burdens on the other.

npj ComplexityVol. 1(1)
University of Duisburg-Essen (DE)
Deutsche Forschungsgemeinschaft
Sustainable cities and communities
Openalex Percentile: Top 15%
Urban Transport and Accessibility
1.37
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

How much longer do you have to drive than the crow has to fly? — Michael Schreckenberg, Thomas Guhr, et al. · npj Complexity (2024) | TGRS Research Map | TGRS