The package README shows how the PCT can be used to get and reproduce some of the datasets from the PCT package, based on an example in the city of Leeds. This vignette shows how the package can be used to create estimates of cycling potential in other cities.
Let’s start by loading the package:
The input data for this vignetted was created using code in the pctSantiago project. It looks like this, in terms of the flow data:
head(santiago_od) #> # A tibble: 6 x 7 #> ZonaOrigen ZonaDestino n av_weight all range_weights pcycle #> <dbl> <dbl> <int> <dbl> <dbl> <dbl> <dbl> #> 1 259 497 5 691. 3453. 62.4 0 #> 2 260 261 17 206. 3495. 967. 0 #> 3 261 260 17 228. 3868. 967. 0 #> 4 263 264 5 517. 2586. 819. 0 #> 5 264 263 5 508. 2542. 853. 0 #> 6 266 501 2 1982. 3965. 1700. 0
In terms of the zone data, they look like this:
sf:::print.sf(santiago_zones) #> Simple feature collection with 75 features and 1 field #> geometry type: POLYGON #> dimension: XY #> bbox: xmin: -70.69203 ymin: -33.47766 xmax: -70.58239 ymax: -33.403 #> geographic CRS: WGS 84 #> First 10 features: #> geo_code geometry #> 259 259 POLYGON ((-70.65174 -33.431... #> 260 260 POLYGON ((-70.65008 -33.443... #> 261 261 POLYGON ((-70.64562 -33.437... #> 262 262 POLYGON ((-70.64643 -33.477... #> 263 263 POLYGON ((-70.64913 -33.459... #> 264 264 POLYGON ((-70.64914 -33.459... #> 265 265 POLYGON ((-70.65058 -33.450... #> 266 266 POLYGON ((-70.65058 -33.450... #> 292 292 POLYGON ((-70.60615 -33.419... #> 293 293 POLYGON ((-70.60673 -33.415... plot(santiago_zones)
Note that we have cycling estimates for each desire line. If this data is not known, current cycling levels can be approximated for all desire lines as the city-wide average, e.g. around 5% for Santiago.
The origin-destination data can be converted to geographic desire lines using the
od2line as follows:
The resulting lines can then be plotted on top of zone data as follows:
The previous map suggests that the data is reliable: we have created a good approximation of the travel pattern in central Santiago.
To estimate cycling potential, we need estimates of distance and hilliness. The area under investigation is relatively flat so we can make the simplifying assumption that hilliness is 0% for all lines (normally we would get this information from a routing service):
And what about the distance? We can calculated it as follows (note we converted this into a numeric object to prevent issues associated with the
Now we have (very) crude estimates of distance and hilliness, we can estimate the cycling potential as follows:
Let’s take a look at the results, compared with the current levels of cycling, and compared with distance:
As expected, there is a positive (albeit small) positive correlation between current and potential levels of cycling. The result shows clearly that distance decay kicks in just after 2km, but still at 8 km there is a 25% mode share, suggesting a major switch to cycling.
We can put the results on a map as follows:
The results show that there is substantial potential for increasing the levels of cycling in central Santiago, based on origin-destination data alone. However, to inform policy, more detailed estimates of cycling potential are needed, with results that go down to the level of individual streets. This involves routing.
There are many ways to do calculate a path on the street network. The main options are local routing, where the calculation is done based on data stored locally (on your computer) and routing services, where the data is done remotely (‘in the cloud’). Let’s use a remote routing service to convert the straight lines generated in the previous section into routes that could realistically be taken by people cycling (the next line does not run by default because it requires an API key saved as an environment variable, see the documentation of
route_cyclestreets() for details for details).
santiago_routes_cs = stplanr::line2route(desire_lines) # > 10 % out of 200 distances calculated # > 20 % out of 200 distances calculated # > 30 % out of 200 distances calculated # > 40 % out of 200 distances calculated # > 50 % out of 200 distances calculated # > 60 % out of 200 distances calculated # > 70 % out of 200 distances calculated # > 80 % out of 200 distances calculated # > 90 % out of 200 distances calculated # > 100 % out of 200 distances calculated # > Warning message: # > In value[[3L]](cond) : Fail for line number 32
Note that one of the routes failed. We can look at this route as follows, to try to understand what happened:
The result shows that one end of the route connects to the Sendero Ciclistas, which the routing service may be unable to reach. At this stage there are 2 main options: 1) to omit the data point from the analysis, acknowledging that the data is incomplete; or 2) identify a nearby location where the service can route to. In this case we will take option 1. Before we remove the offending line 32 from the analysis, we will join the data from the desire lines back onto the results:
routes$godutch_slc = round(routes$godutch_pcycle * routes$all) rnet = stplanr::overline2(routes, "godutch_slc") #> 2020-06-15 10:32:04 constructing segments #> 2020-06-15 10:32:04 building geometry #> 2020-06-15 10:32:04 simplifying geometry #> 2020-06-15 10:32:04 aggregating flows #> 2020-06-15 10:32:05 rejoining segments into linestrings plot(rnet, lwd = rnet$godutch_slc / mean(rnet$godutch_slc))
Clearly to do this in a production environment we would use a larger dataset, but the concepts would be the same. We would refine the method in multiple ways. The next basic step, however, would be to convert the straight desire lines into routes, to calculate more accurate distance and hilliness levels for each OD pair. Then we would be able to create a route network to help prioritise cycling across the city.