Beruflich Dokumente
Kultur Dokumente
t = t
0
* (1 + (v/c)
)
Where;
t li k t l ti t link travel time
t
0
free flow travel time
0
v link flow
li k it c link capacity
, parameters ( = 0.15, = 4) , p ( 5, 4)
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
Trip Assignment
43
Trip Assignment
Trip makers choice of path between origin
d d ti ti and destination
Path: streets selected Path: streets selected
Transit: usually set by route
Results in estimate of traffic volumes on
each oad a i the et o k each roadway in the network
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
Person Trips vs Vehicle Trips
44
Person Trips vs. Vehicle Trips
Trip generation step calculated total person trips
T i i t d l ith l t Trip assignment deals with volume not person
trips
Need to adjust person trips to reflect vehicle trips
Understand units during trip generation phase Understand units during trip generation phase
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
Person Trips vs. Vehicle Trips
45
p p
Example
Usually adjust by average auto occupancy
Example: Example:
If:
average auto occupancy = 1 2 average auto occupancy = 1.2
number of person trips from zone 1 = 550
So:
V hi l t i t i / hi l Vehicle trips = 550 person trips/1.2 persons per vehicle =
458.33 vehicle trips
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
Ti f D P tt
46
Time of Day Patterns
Trip generation usually based on 24-hour
i d period
LOS calculations usually based on hourly LOS calculations usually based on hourly
time period
Hour, particularly peak, is often of more
interest than daily interest than daily
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
Ti f D P tt
47
Time of Day Patterns
Common time periods
M i k Morning peak
Afternoon peak
Off-peak
Calculation of trips by time of day Calculation of trips by time of day
Use of factors (e.g., morning peak may be
% f d il ffi ) 11% of daily traffic)
Estimate trip generation by hour p g y
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
Mi i P th
48
Minimum Path
Theory: users will select the quickest route
b d d between any origin and destination
Several route choice models (all based on (
some minimum path)
All or nothing All or nothing
Multipath
Capacity restraint Capacity restraint
User Equilibrium
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
Mi i P th
49
Minimum Path
Starts at zone and selects minimum path to
h i f d each successive set of nodes
Until it reaches destination node
2
1
5
(3) (2)
(7)
3
4
5
(4)
(4)
3
Path from 1 to 5
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
All N thi
50
All or Nothing
Allocates all volume between zones to
i i th b d f fl li k minimum path based on free-flow link
impedances p
Does not update as the network loads
Becomes unreliable as volumes and travel
time increases time increases
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
C it R t i t
51
Capacity Restraint
Once vehicles begin selecting the
minimum path between a set of nodes minimum path between a set of nodes,
volume increase and so do travel times
Original minimum paths may no longer
be the minimum path be the minimum path
Capacity restraint assigns traffic
it ti l d ti i d t h iteratively, updating impedance at each
stepp
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
Wardrop Equilibrium
52
Wardrop Equilibrium
"Under equilibriumconditions traffic Under equilibrium conditions, traffic
arranges itself in congested networks in
h th t i di id l t i k such a way that no individual trip maker can
reduce his path costs by switching routes". reduce his path costs by switching routes .
All used routes between any Origin /
Destination pair have equal and minimum
costs, while all unused routes have greater costs, while all unused routes have greater
or equal costs."
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
Final Outputs from Traffic
53
p
Assignment
Amount of travel congestion speed per link Amount of travel, congestion, speed per link
Total transport cost, time, VMT
By applying other coefficients:
Accidents Accidents
Air pollution
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA
ALVINSYAH
TRANSPORT RESEARCH GROUP
CIVIL ENGINEERING
DEPARTMENT
UNIVERSITY OF INDONESIA