Side Constrained Traffic Assignment Model Based on Network Dual Equilibrium

One side constrained traffic assignment model is presented based on the local nearsighted user equilibrium principle by taking advantage of network dual equilibrium theorem. The traffic flow and travel time are regarded as a pair of dual variables. The analysis is started from the basic elements of network. At first, the dual relationships between the conservation conditions of node's flow and the shortest travel time from origin to the node are considered. Then the dual relationships between link flow and travel time constrains on link with nearsighted users are also analyzed. At last, through combining these dual relationships and adding generalized side constraints, new traffic assignment model is built. How to embody two behavioral assumptions (priority of playing cards and elasticity of route adjusting on route) in the proposed algorithm to the model is analyzed. A searching method of effective path set is given by using the model's solution results of unique link flow with respect to origin and destination pair. Several numeral examples are given to prove the validity and efficiency of the model and related algorithm. The results for the side constrained model are explained by congestion pricing and queue delay on links.