The figure below represents a simple network with one origin…
The figure below represents a simple network with one origin (O), one destination (D), two internal nodes (1 and 2), and five network links. The link travel times are also indicated on the figure. In this case, the link travel times are a constant (i.e., do not vary as a function of link flows). The demand for travel between the origin and destination is 100 trips. Based on an “all-or-nothing” assignment scheme, determine the flows on each link of the network. What would be the link flows at user-equilibrium? Present your answer in the form of a table as shown below (you can insert a table in your answer space) Link All-or-nothing flow User equilibrium flow O-1 O-2 2-1 2-D 1-D
Read Details