Scribd
Upload
13 views2 pages

Assignment 3

This assignment focuses on Traffic Network Equilibrium, requiring rigorous explanations for solutions. It includes tasks such as performing UE calculations, constructing algorithms for identifying last common nodes, and proving properties of cycles in network paths. Additionally, students must compute objective functions for OD matrix estimation problems based on given parameters.

Uploaded by

indrakumar180100
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
13 views2 pages

Assignment 3

This assignment focuses on Traffic Network Equilibrium, requiring rigorous explanations for solutions. It includes tasks such as performing UE calculations, constructing algorithms for identifying last common nodes, and proving properties of cycles in network paths. Additionally, students must compute objective functions for OD matrix estimation problems based on given parameters.

Uploaded by

indrakumar180100
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/ 2

CE 272

Traffic Network Equilibrium

Assignment 3
Due April 13

General Instructions: Please explain your solutions rigorously and in detail. Points will be
deducted for ‘handwavy’ arguments. If a problem has an ⇔ statement, you have to provide
proofs for both directions. Each question has a label (LX), where X denotes the lecture number
containing the relevant background material.

1. (L20) Repeat the UE calculations using three iterations of gradient projection on the
network used in Assignment 2. Also report the all-or-nothing link flows, relative gap, and
AEC at each iteration. If you use Excel, submit the spreadsheet on Teams.

2. (L22-L23) Dial’s Algorithm B requires finding the shortest and longest paths and identi-
fying the pairs of alternate segments (PAS) using the last common node. For example,
in the following network, if the shortest path is 1-5-6-10-14-15-16 and the longest path is
1-2-6-10-11-7-8-12-16, then the last common node is 10.

13 14 15 16 13 14 15 16

9 10 11 12 9 10 11 12

5 6 7 8 5 6 7 8

1 2 3 4 1 2 3 4

Shortest Path Longest Path

(a) Construct an efficient algorithm which takes the shortest and longest path vectors
as inputs and returns the last common node for a general bush. Remember that, by
convention, if the shortest and longest paths are the same, the destination is assumed
to be the last common node.
(b) Demonstrate your algorithm using the above example (assume that the bush com-
prises of only links belonging to the two paths and topologically order nodes) and
comment on the computational complexity of your method. (Points will be propor-
tional to the efficiency of the proposed algorithm.)

3. (L23-L24) In the ‘Optimize Bush’ step of Algorithm B,

(a) Prove that cycles will not be created when longest path labels νir are used to update
the bushes.
(b) Construct a small example (using a 3 or 4 node network) to demonstrate that adding
new links using the shortest path labels can create cycles.

4. (L23-L24) Complete three iterations of Algorithm B on the network discussed in class.

1
5. (L25) For the following network, compute the objective function of the OD matrix esti-
mation problem and it’s gradient at the solution d14 = 6, d34 = 4. (There is no demand
between other OD pairs.) Assume that link volumes on arc (3, 2) and (3, 4) are observed
to be 3 and 2 respectively and the seed OD demand dˆ14 = dˆ34 = 5. Also suppose that the
weighing parameter in the objective γ = 0.5.

2
50 + 𝑥 10𝑥

1 10 + 𝑥 4

15𝑥 60 + 𝑥

You might also like