Traffic Analysis Toolbox Volume XIV: Guidebook on the Utilization of Dynamic Traffic Assignment in Modeling

Figure 2.2 Long Description

Figure 2.2 is a flow chart that illustrates a static traffic assignment algorithmic structure. The top portion of the graphic includes three processes connected in a circular flow. Update Link Cost Based on Updated Link Flow Using Bureau of Public Roads Functions leads to Find Shortest Path and Auxiliary Flow. That leads into Update Link Flow, which then leads back to Update Link Cost Based on Updated Link Flow Using Bureau of Public Roads Functions.

The link flow is then compared to the Stopping Criterion. The first criteria are If All The Travel Times Are Equal For All Used Paths Then Stop. The second criteria are If The Flow Stop Changing Then Stop. These two criteria flow back and forth.