Authors: John Miron*, University of Toronto
Topics: Transportation Geography, Planning Geography, Urban Geography
Keywords: planning, transportation, cities
Session Type: Paper
Start / End Time: 12:40 PM / 2:20 PM
Room: Poydras, Sheraton, 3rd Floor
Presentation File: No File Uploaded
This paper considers planning a regional transportation network in the context of purposeful behavior by users and political actors. Transportation networks are typically assembled by building links from one town to the next. As a starting point, the state might well be interested in a network that links towns at the lowest total construction cost. In graph theory, this is akin to the notion of a minimum spanning tree. I begin with network design based on the concept of a minimum spanning tree and the Euclidean Steiner Problem. Then, I show how a full model (network use sub-model and state sub-model) can be developed from this. I consider breaking a linear guideway into sections so that we can think about the consequences for the state of each section. I consider how add a second linear guideway segment where we already have a first linear guideway segment. This allows networks that are more complex than the single linear guideway. I show the importance here of the complementarity where a trip that previously used only local roads comes to use part or all of a new link in addition to part or all of an existing link. I also consider how the state might price use of the transportation system under the assumption that the state does not discriminate between users of different segments.