Developing Capital Improvement Plan for City Roads: A Budget-Conscious Approach
Explore the project to create a capital improvement plan for managing the roads of City of Fort Wayne on a limited budget. The project involves utilizing datasets, applying the minimum path algorithm, and analyzing transportation networks to determine the shortest travel time paths. Dive into steps to assign trips efficiently and consider the minimum path tree for Zone 1 in the transportation network.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
PRESENTATION TITLE PRESENTATION TITLE Course project Project title: Develop a capital improvement plan for managing the roads of City of Fort Wayne within a limited budget. Get into groups of 3 or 4 (send me an email with names by this Friday) Datasets will be provided. Handouts: rubric and timeline
PRESENTATION TITLE PRESENTATION TITLE TRAFFIC ASSIGNMENT TRAFFIC ASSIGNMENT Minimum Path Algorithm Reading: Chapter 12 Forecasting Travel Demand (Section 12.5)
PRESENTATION TITLE PRESENTATION TITLE O-D Matrix 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 1 0 50 75 80 100 125 60 30 90 40 80 25 70 60 20 85 2
PRESENTATION TITLE PRESENTATION TITLE Minimum Path Algorithm The minimum path method assigns all trips to those links that comprise the shortest time path between the two zones.
PRESENTATION TITLE PRESENTATION TITLE Consider the following 16-node transportation network with travel times on each link shown for each node (zone) pair. Determine the shortest travel time path from node 1 to all other zones?
PRESENTATION TITLE PRESENTATION TITLE
PRESENTATION TITLE PRESENTATION TITLE Solution:
PRESENTATION TITLE PRESENTATION TITLE Steps: 1. Determine the time to nodes connected to node 1. 2. From the node closet to the home node, make connections to nearest nodes. Write cumulative travel times at each node. 3. From the node that is now closet to the home node, make connections to nearest nodes. Write cumulative travel times at each node. 4. .
PRESENTATION TITLE PRESENTATION TITLE Minimum Path Tree for Zone 1
