TRANSPORTATION PLANNING

FIRST SEMESTER AY 2019-2020

ROUTE ASSIGNMENT

Agno, Angelicka
Cablao, Austin Lorenz
Cornejo, John Michael
Medrano, Rosenie
Mendoza, Jessa Mae
Tolentino, Jonna Mae
Valencia, Warren

Assign the vehicle trips in the given network below using all-or-nothing assignment.
Use Dijkstra’s algorithm to find minimum paths.

D
O 1 2 3 4 5 6

1 0 400 250 130 200 90

2 320 0 280 180 400 150

3 450 100 0 170 230 290

4 190 300 200 0 100 420

5 150 400 180 250 0 140

6 500 210 40 80 200 0

 40’

20’

2 4
30’ 8’
12’

50’
1
3
24’
36’ 10’
5’ 26’
10’
5v 6

17’
 MINIMUM PATH
Total traffic volume Total traffic volume

LINK VOLUME LINK VOLUME

1-2 400 4-3-6-5-1 840
1-6-3 130 4-3-2 300
1-5-6-3-4 550 4-3 200
1-5 200 4-3-6-5 690
1-5-6 340 4-3-6 490
2-1 320 5-1 150
2-3 280 5-6-3-2 280
2-3-4 450 5-6-3 180
2-3-6-5 770 5-6-3-4 350
2-3-6 570 5-6 140
3-6-1 790 6-5-1 350
3-2 100 6-3-2 140
3-4 170 6-3 40
3-6-5 490 6-3-4 210
3-6 290 6-5 200
D
1 2 3 4 5 6
O

1 - 1-2 1-6-3 1-5-6-3-4 1-5 1-5-6

2 2-1 - 2-3 2-3-4 2-3-6-5 2-3-6

3 3-6-1 3-2 - 3-4 3-6-5 3-6

4 4-3-6-5-1 4-3-2 4-3 - 4-3-6-5 4-3-6

5 5-1 5-6-3-2 5-6-3 5-6-3-4 - 5-6

6 6-5-1 6-3-2 6-3 6-3-4 6-5 -

.

Total traffic volume for each Total traffic volume for each
link in the system link in the system
LINK VOLUME LINK VOLUME
1-2 400 3-6 2230
1-6 250 4-3 1210
1-5 420 5-1 840
2-1 320 5-6 1190
2-3 1010 6-1 450
3-2 1010 6-3 1540
3-4 810 6-5 1620