Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1of 31

Transportation Planning and Modeling

Transportation planning is a field involved with the evaluation, assessment,


design and siting of transportation facilities (generally streets, highways, footpaths,
bike lanes and public transport lines). – Wikipedia, Aug 29, 2010 Image: public domain
Rational Planning Method
– defining goals
and objectives,
– identifying
problems,
– generating
alternatives,
– evaluating
alternatives, and
– developing plans

Image: GNU Free Documentation License


Daniel Schwen, the copyright holder
Des Moines MPO
http://www.dmampo.org/
Planning Options
• Short run
– TSM
– TDM
– Access Mgmt.
– Congestion Mgmt.
• Long Run
– Construction
– Land use
• Future?
– Pricing
– Technology (ITS, fuels)
Congestion Pricing
• http://www.streetfilms.org/archives/campaign-for-new-yorks-future-congestion-pricing/

Why we don’t use congestion pricing:


http://planningresearch.blogspot.com/2007/03/m
anville-on-why-we-dont-use-congestion.html
Travel demand modeling
• Evaluating alternatives requires
– Estimated travel demand (trips)
– Estimated trip lengths
– Estimated modal shares
– Estimated travel speeds
– Estimated travel delays
– Estimate air quality, noise and energy impacts
• Need a systematic process
“Four” step model

sometimes omitted

optional
Data collection
• Demographic/Socioeconomic
• Transportation system
• Travel behavior/propensity/desires
– Surveys
Study area/zone
a r y slide
u n d
Bo
PO
n e sM
o i
s M
De
Zs )
TA
ne s(
Zo
Travel Demand Modeling
(Forecasting)
• What is travel “demand”?
• Three factors
– Land use
– Socioeconomics and demographics
– Transportation services

(TTYP name 3
characteristics
of these factors
that affect demand)
Trip Generation
• Determine number of “trip ends”
• Methods
– Cross Classification (tables)
– Rates based on activity units (ITE)
– Regression
Trip Distribution
• Determine origin and destination of trips
• Methods
– Gravity model (Need a good shortest path
algorithm)
– Growth factor models
Find the shortest path from node
1 to all other nodes (from Garber and Hoel)

1 1 2 3 3 6 4

2 4 2 1

5 2 6 3 7 2 8

2 3 1 1

9 4 10 3 11 3 12

2 3 1 1

13 4 14 4 15 4 16

Yellow numbers
3 represent link travel times in minutes
FINAL
1 4
1 2 3 4
9

2 6 8
5 6 7 8
4

4 9
7 7
9 10 11 12

1
6 8
0
13 14 15 16
1
0
http://mitchlanaillustration.blogspot.com

©1995 - 2008, AMERICAN PHYSICAL SOCIETY From: Davison E. Soper


APS encourages the redistribution of the materials included in this newspaper
provided that attribution to the source is noted and the materials are not truncated or Univ of Oregon
changed.
Mode Choice (Split)
• Which mode (transit, walk, carpool,drive
alone, …) will be used?
• Methods
– Direct generation
– Trip end models
– Trip interchange models
Traffic Assignment
• Which route will the trips take?
• Methods
– Minimum path (distance or time)
– Capacity restrained
• Need a good shortest path algorithm

You might also like