Assign the vehicle trips shown in the following O-D trip table to the network, using the all-or-nothing assignment technique. To summarize your results, list all of the links in the network and their corresponding traffic volume after loading.
Origin-Destination Trip Table:
[Solution Shown Below]
The all-or-nothing technique simply assumes that all of the traffic between a particular origin and destination will take the shortest path (with respect to time). For example, all of the 200 vehicles that travel between nodes 1 and 4 will travel via nodes 1-5-4. The tables shown below indicate the routes that were selected for loading as well as the total traffic volume for each link in the system after all of the links were loaded.