Recall Pigou's example discussed in class, where there are two roads that connect a source, s, and destination, t. The roads have different travel costs. Fraction ₁ of the traffic flow on route 1, and the remainder x2 on route 2. Here consider the following scenario. • The first road has “infinite” capacity but is slow and requires 1 hour travel time, T₁ = 1. . The second road always requires at least 15 mins, which then increases as a function of traffic density, T₂ = 0.25 +0.75x₂. If drivers act in a "selfish" manner - the user optimal scenario - all the traffic will flow on the second path, as one is never worse off. Worst case scenario for path 2, both paths take one hour. So no one is incentivized to change their behavior. 1. Assume user optimal behavior, and calculate the expected travel time per car. 2. If instead we could control the flows, we could minimize the expected travel time. Using the expression in part (a), calculate the optimal allocation of flows ₁ and ₂ that minimize the expected travel time per car. 3. What is Tm, the expected travel time when the flow is optimized?

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Below is the question

Recall Pigou's example discussed in class, where there are two roads that connect a
source, s, and destination, t. The roads have different travel costs. Fraction ₁ of the
traffic flow on route 1, and the remainder x2 on route 2. Here consider the following
scenario.
• The first road has “infinite” capacity but is slow and requires 1 hour travel time,
T₁ = 1.
. The second road always requires at least 15 mins, which then increases as a
function of traffic density, T₂ = 0.25 +0.75x₂.
If drivers act in a "selfish" manner - the user optimal scenario - all the traffic will
flow on the second path, as one is never worse off. Worst case scenario for path 2,
both paths take one hour. So no one is incentivized to change their behavior.
1. Assume user optimal behavior, and calculate the expected travel time per car.
2. If instead we could control the flows, we could minimize the expected travel
time. Using the expression in part (a), calculate the optimal allocation of flows
₁ and ₂ that minimize the expected travel time per car.
3. What is Tm, the expected travel time when the flow is optimized?
Transcribed Image Text:Recall Pigou's example discussed in class, where there are two roads that connect a source, s, and destination, t. The roads have different travel costs. Fraction ₁ of the traffic flow on route 1, and the remainder x2 on route 2. Here consider the following scenario. • The first road has “infinite” capacity but is slow and requires 1 hour travel time, T₁ = 1. . The second road always requires at least 15 mins, which then increases as a function of traffic density, T₂ = 0.25 +0.75x₂. If drivers act in a "selfish" manner - the user optimal scenario - all the traffic will flow on the second path, as one is never worse off. Worst case scenario for path 2, both paths take one hour. So no one is incentivized to change their behavior. 1. Assume user optimal behavior, and calculate the expected travel time per car. 2. If instead we could control the flows, we could minimize the expected travel time. Using the expression in part (a), calculate the optimal allocation of flows ₁ and ₂ that minimize the expected travel time per car. 3. What is Tm, the expected travel time when the flow is optimized?
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,