r-he Inverse of The Static Traffic Assignment Problern With Constant Link Costs • -:

Abstract

Due to increasing population and wealth congestion over the transportation networks becomes significant. According to the limited possibilities of expanding transportation networks, the only way to overcome congestion is reassigning traffic flows over the transpo11ation network. However, the reloaded flows should minimize the total travel costs over the traffic network for the.benefit of the whole society.

The problem addressed in chapter 2 is the distribution of traffic flow over a given transportation network in the detenninistic envirorunent. Deterrrlinistic traffic assignment models are based on the assumption that all travelers have good information about route costs. Therefore, they choose traversing through the least cost routes connecting their origin-destination pair of nodes. When link costs are considered as constants, we have two formulations of the traffic assigmnent problem. The first is the circulatory network flows where link flows are considered as the decision variables. While the other formulation is the all-or-nothing, this is used 'Yhen traffic platmcrs are interested in route flows. Once link costs are functions of the link flows, the notion of equilibrium is raised.