Second Experiment: Optimal Number of Lanes
The purpose of this second experiment is to run the computer program
LESN and compute the optimal number of lanes N* needed for a highway segment
of length L miles and an input flow rate . The program requires you
to input the maximum vehicle speed in mph and the maximum jam density.
Input flow rate
vph, length of the highway segment L miles and the blocking probability
Pc . This blocking probability should be a small number preferably close
to 0 (e.g. .001) since one wants to minimize the blocking caused by the
congestion in the highway segment so that conditions as close to free flow
traffic occurs. The program iterates until it outputs the optimal number
of lanes N*.
Experiment 2: In this experiment, start out with
a basic highway segment and input flow volume
vph and record the number of lanes necessary. Now let us increase the input
flow volume and record how N* changes to
sudden changes in of a highway segment?
Do this for both the linear and exponential models.
As another variation with this program LESN, vary L instead of and determine how sensitive the lanes are along with the
other performance measures.
Lambda (input flow rate)
Animation of Congestion levels for 1, 2, 3, and 4 lanes