Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
132 views12 pages

Traffic Assignment

The document discusses traffic assignment, which is the final step in the transportation forecasting process used to determine expected traffic volumes on roads and transit routes. It requires data on trips between zones, available routes, travel times, an algorithm, and external trips. The basic approaches are the minimum time path assuming all traffic uses the fastest route, and the minimum time path with capacity restraint that recalculates travel times as links reach capacity through iterations until balance is achieved. An example is provided to illustrate the capacity restraint approach.

Uploaded by

jordzmallari1218
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
132 views12 pages

Traffic Assignment

The document discusses traffic assignment, which is the final step in the transportation forecasting process used to determine expected traffic volumes on roads and transit routes. It requires data on trips between zones, available routes, travel times, an algorithm, and external trips. The basic approaches are the minimum time path assuming all traffic uses the fastest route, and the minimum time path with capacity restraint that recalculates travel times as links reach capacity through iterations until balance is achieved. An example is provided to illustrate the capacity restraint approach.

Uploaded by

jordzmallari1218
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

TRAFFIC ASSIGNMENT

CEC 312 – Principles of Transportation Engineering


Traffic Assignment
- Final step in transportation forecasting process.
- This is the procedure used to determine the expected
traffic volumes.
Traffic Assignment
Data required:
1. Number of trips from one zone to another
2. Available highway or transit routes between zones
3. Travel time between routes
4. Decision rule (or algorithm)
5. External trips (w/c were not considered in previous
steps)
Traffic Assignment
Basic Approaches:
1. Minimum time path (all-or-nothing)
2. Minimum time path (w/ capacity restraint)
Traffic Assignment
Minimum Time Path
- produces accurate results and demonstrates basic
principles.
- based on the theory that the traveler will select the
QUICKEST ROUTE between any origin destination pair.
Example 1.
5 min 2 min
1 2 3
A B For Route 1-3
1-2-3 = 5+2 = 7 mins
4 min G 3 min H 4 min I 3-2-1 = 2+5 = 7 mins
For Route 1-6
3 min 4 min
4 5 6 1-2-3-6 = 5+2+4 = 11 mins
C D 1-4-5-6 = 4+3+4 = 11 mins
2 min J 6 min K 6 min L 1-2-5-6 = 5+3+4 = 12 mins

6 min 3 min
7 8 9
E F
Example 1.
5 min 2 min
1 2 3
A B

4 min G 3 min H 4 min I For Route 7-2

3 min 4 min
4 5 6 For Route 1-9
C D
2 min J 6 min K 6 min L

6 min 3 min
7 8 9
E F
Traffic Assignment
Capacity Restraint
- The number of trips assigned to each link is compared with the
capacity of the link to determine the extent to which link travel times have
been increased.
- We recalculate the new link travel time.
- Iteration process continues until balance is achieved.
Traffic Assignment
Capacity Restraint
Link performance function Capacity restraint relationship
Example 1.

2.27 mins
Example 2.
Given the following information, and using the generalized capacity
restraint link performance function, perform two iterations of multipath
traffic assignment. A flow of 10, 500 vehicles in the peak hour is to be
distributed between three routes whose properties are given in the
following table.
Example 2.

You might also like