Scribd
Upload
51 views15 pages

Route Assigment

Route assignment involves determining the optimal routes between origins and destinations in a transportation network. It is used to evaluate existing transportation systems and proposed improvements. Key factors in route assignment include travel time, cost, comfort, and road capacity. Dijkstra's algorithm is commonly used to find the shortest path between locations by progressively assigning permanent labels to neighboring nodes starting from the origin node.

Uploaded by

Patrick Henry Dela Vega
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
51 views15 pages

Route Assigment

Route assignment involves determining the optimal routes between origins and destinations in a transportation network. It is used to evaluate existing transportation systems and proposed improvements. Key factors in route assignment include travel time, cost, comfort, and road capacity. Dijkstra's algorithm is commonly used to find the shortest path between locations by progressively assigning permanent labels to neighboring nodes starting from the origin node.

Uploaded by

Patrick Henry Dela Vega
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/ 15

ROUTE

ASSIGNMENT
Route Assignment
- A route is simply a chain of links between an
origin and destination.
- It concerns the selection of routes between
origins and destinations in transportation
networks.
Applications of Route Assignment
Applications:
- To determine the deficiencies in the existing
transportation system
- To evaluate the effects of limited improvement and
additions to the existing transportation
- To develop construction priorities for intermediate years
- To test alternative transportation system proposal
- To provide design hour traffic volumes on highways &
turning movements on junctions.
Factors of Route Assignment
Factors:
1. Travel times
2. Travel costs
3. Comfort and convenience
4. Levels of service (Volume/capacity)
Route Assignment
Given a road network, car drivers will normally use
the route or routes through which they will reach their
destination in the least time or distance. The same
assumption is used to assign trips or vehicles in the four-
step model. The road network is usually drawn using nodes
and links as shown in figure 1. The zone centroids are
represented by nodes, and the roads connecting the zones
are presented by links.
Route Assignment

Figure 1
Network represented by nodes and links
The Shortest Path
Given a road network with known characteristics such as
distance or travel time, the shortest path may be found
using Dijkstra’s algorithm.
The algorithm or procedure follows these basic steps:
a. First, label the starting node with a value equal to 0. This
label is permanent as this will not be changed.
b. Consider each node adjacent to this node and give them
temporary labels. (Only those without permanent labels are
considered.)
The Shortest Path
i. If a node is unlabeled, it is given a label equal to the
weight of the link plus the value of the previously
labelled node.
ii. If a node is labelled, calculate the value of the label
and, if this is less than the current value, then
exchange its value with the smaller one; otherwise, leave
the label unchanged.
c. Choose the node with the smallest temporary label and make
the label permanent.
d. Repeat steps b and c until the final node has been given a
permanent label. The shortest path has a length given by its
permanent value.
Dijkstra’s Algorithm - Example
Consider the road network shown in figure 2 (A).
The nodes are labeled a to k. The links have values in
travel time in minutes. Determine the shortest path (least
travel time) from a to k using Dijkstra’s algorithm.
Dijkstra’s Algorithm - Example
Solution:
Node 𝑎 is given a
permanent label with value
equal to 0. From 𝑎, adjacent
nodes are temporarily
labelled as shown in (B).
With 2 as the smallest, node
𝑏 is permanently labeled as
shown in (C). From node 𝑏,
adjacent nodes are
temporarily labelled.
Dijkstra’s Algorithm - Example
Solution:
Again the node with the
smallest value is chosen. Note
that either node 𝑐 or 𝑒 may be
chosen because they both
have values equal to 3. Node 𝑐
is chosen in this case, and
unlabeled nodes adjacent to it
are labeled temporarily as
shown in (D). The steps are
repeated. It will be noted in (E)
that the value 13 is replaced
by a smaller value, which is 11.
Dijkstra’s Algorithm - Example
Dijkstra’s Algorithm - Example
Dijkstra’s Algorithm - Example
Dijkstra’s Algorithm - Example
It takes steps (A) to (L) to label all the nodes
completely. Finally, node 𝑘 is labeled permanently. The
shortest path from node 𝑎 to 𝑘 follows the route 𝑎 − 𝑒 − 𝑔 −
𝑗 − 𝑘 with a total travel time of 23 minutes.

You might also like