logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Create a map showing walking access isochrones to public libraries in Toronto.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Pedestrian Accessibility To Libraries

6 marks

your task is to map pedestrian accessibility to public libraries.

In the data.zip/part3 folder, a pedestrian network dataset is pulled from OpenStreetMap. There is also a point file of the locations of public libraries.

A). Create a map showing walking access isochrones to public libraries in Toronto. Have the map show 2 bands of access one at 750m and another for 1500m (these approximately correspond to a 10-minute and 20 minute walk). Also include on your map a layer representing population in the City of Toronto (see the census sub-folder for population data), as it will

help highlighting under-served areas. (3)

B). Describe in words the steps you used to create your map (1)

C). Briefly describe the patterns on the maps and evaluate the quality of pedestrian accessibility to libraries in Toronto. (1.5)

D). Based on your map, recommend one area for where you think the City of Toronto should look for property to build a new library branch. (0.5)

 

 

Transit Accessibility To Employment

6 marks

Now let’s try to measure and map transit accessibility to employment in Toronto.

To help you out, I’ve created an Origin-Destination matrix of travel times by transit between Census Tract centroids. This is stored in tij.csv where the rows are origins (i) and the columns are destinations (j).

The travel times were based on an 8am departure time. The network data used to generate the travel times is a combined transit and walking network using R5R. The transit part is based

on pre-COVID transit schedules (from November of 2019) and OpenStreetMap is used for the walking part. The travel times thus include time walking to and from stops, waiting for a transit vehicle, and any transferring time (if applicable).¾

 

The provided employment data is from the 2016 census. These values are the number of jobs located in a census tract for people who do not work from home (i.e. jobs that people commute to)

A). Create a choropleth map showing the number of jobs that can be reached in less than or equal to a 45 minute transit trip from each census tract. Overlay the map with the locations of existing rapid transit lines and stations (3.5)

B). Briefly describe the pattern on the map. How is transit accessibility to jobs distributed throughout the city? (1)

C). Discuss three limitations about the source data and/or methodology used in creating this accessibility measure (1.5)

 

Accessibility & Commuting

8 marks

 

Let’s compare the transit accessibility map in Part 4 to a couple of travel behaviour outcomes based on the provided 2016 census journey to work data. The goal of this analysis will be to see whether, and if so how and where, transit accessibility is related to commuting outcomes.

A). Create a choropleth map of census tracts showing transit mode share for journey to work trips. (1.5)

B). Create a scatter plot of transit accessibility compared to transit mode share (1)

C). Create a choropleth map of census tracts showing the percent of commuters who have a commute of 60 minutes or more one-way (these are often called "extreme" commuters) (1.5) D). Create a scatter plot of transit accessibility compared to the percent of commuters who have a commute of 60 minutes or more one-way (1)

E). Based on your maps and plots, describe how and speculate why (or why not) transit accessibility is related these two travel behaviour outcomes. (3)

(for the scatter plots, each point on the plots should be a census tract)

 

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

678 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

779 Answers

Hire Me
expert
Husnain SaeedComputer science

627 Answers

Hire Me
expert
Atharva PatilComputer science

641 Answers

Hire Me
June
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30