Scribd
Upload
13 views2 pages

Assignment 2

This assignment for CE 272 focuses on traffic network equilibrium, requiring detailed explanations and rigorous proofs for various problems. Students must demonstrate the use of MSA and FW algorithms to calculate user equilibrium and system optimal link flows, as well as analyze optimization problems related to multi-class traffic assignment. The assignment includes specific tasks involving spreadsheets and analytical solutions, with a submission deadline of March 27 at 8:00 AM.

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 2

This assignment for CE 272 focuses on traffic network equilibrium, requiring detailed explanations and rigorous proofs for various problems. Students must demonstrate the use of MSA and FW algorithms to calculate user equilibrium and system optimal link flows, as well as analyze optimization problems related to multi-class traffic assignment. The assignment includes specific tasks involving spreadsheets and analytical solutions, with a submission deadline of March 27 at 8:00 AM.

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 2
Due 8:00 AM March 27

General Instructions: Please explain your solutions rigorously and in detail. Points will be
deducted for ‘handwavy’ arguments. If a problem has an ⇔ or an iff 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. Please submit hand-written responses
and scanned copies on MS Teams.

1. (L8) Using a spreadsheet, demonstrate the first three iterations of MSA to calculate the
UE solution in the following network. The delay functions on the thick links is 3+(x/200)2 ,
and that on the dashed links is 5 + (x/100)2 . The demand between OD pairs (1,9) and
(4,9) is 1000 vehicles.

7 8 9

4 5 6

1 2 3

Also report the all-or-nothing link flows, relative gap, and AEC at each iteration. Submit
your Excel files along with the solutions of this assignment.

2. (L7, L9) Resolve the above question using the FW algorithm but to compute the system
optimal (SO) link flows and marginal cost tolls (assuming VoT = 1). Use a threshold of
ϵ = 1/26 for the Bisection algorithm.

3. (L11-L12) Using a spreadsheet, demonstrate the first three iterations of MSA to calculate
the UE link flows and demand in the elastic demand scenario for the same network. The
demand between OD pairs (1,9) and (4,9) is 1000e−µrs /100 vehicles.

4. (L13) Show that solving an optimization problem with the following objective and supply-
demand constraints will provide an equilibrium solution to the multi-class traffic assign-
ment.
Z xcij Z xcij
1 X
min tcij (ω, xtij ) dω + tcij (ω, 0) dω
2 0 0
(i,j)∈A
!
Z xtij Z xtij
+ ttij (xcij , ω) dω + ttij (0, ω) dω
0 0

What if the constant 1/2 is removed. Will solving the resulting optimization problem still
give an equilibrium solution. Explain in detail.

1
5. (L13-L14) (Sheffi, Problem 8,7, Modified) Suppose 5 users travel from O to D in the
network shown in the following figure.

O 3 D

The delay functions on the three links are

t1 (x1 , x2 ) = 3 + 2x21 + 2x2


t2 (x1 , x2 ) = 15 + x22 + 2x1
t3 (x3 ) = 20 + x23

(a) Derive the equilibrium solution by solving the UE conditions analytically.


(b) Show that the problem is symmetric. Formulate the associated equivalent minimiza-
tion problem. Perform three iterations of diagonalized FW.
(c) Does the problem have a unique solution? Analyze this point in detail.

You might also like