Saskatoon Bus Data

Raster Points

Frequency vs. Coverage Model

Accessibility - Proximity to Stops

Factors Affecting Heatmap Generation

2017 (June) Routes

2018 (July) Routes

Proposed BRT Routes (July 2018)

2017 - 2018 Route Overlays

Integral of Butterworth Filter

Interesting Resources

Heatmap Modes


Python Coding Notes

DAs for Saskatoon

This file shows the DAs for Saskatoon. The markers show the DA population, and the marker tooltips show the DA IDs. The light blue polygons were used to clip the large DA polygons on the outskirts of the city. The green polygons show the clipped area used for these DAs.

BRT Routes

This file shows all the BRT routes in the datafile obtained from the City of Saskatoon. Here are the same routes in a City supplied Website

However, the routes in the city supplied data do not contain all stop information, as shown in this example of the BRT Green Inbound route.

Example Bus Stop DA Intersection

This is an example of the intersection between a 400m circular buffer and the DA boundaries. The markers are at the centroids of the intersecting polygons.
Click here

Example DA Bus Stop Intersection


In the traditional 2sfca algorithm, Langford used any bus stop that falls within a buffer around the DA centroid (check this?).

Here, we use a different approach. We detect intersections between the DA and bus stop buffers, as shown in the above example for DA 47110114. The markers show the centroids of the intersecting polygons. (There is a section of this DA that has no intersecting polygons and thus is not served by any bus stops). The resulting intersecting polygons represent a section of the DA within the bus stops buffer, and therefore served by the stop, even though the stop is located outside the DA. Some parts of the DA are not served by the stop. The distance used to compute service decay is not the distance from the DA centroid to the stop, but rather the distance from the intersecting polygon to the stop.

The score at any point within the DA is sum of the scores of the intersecting polygons at that point. It is difficult to find all the combinations of the intersections of the intersections. However it is simple to sum the polygon scores at any given point. Therefore we generate and apply raster points and compute the score at the raster points.



Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License