ABSTRACT
In the previous chapter the traffic-assignment problem was introduced. Three general types of algorithm for solving the problem were introduced: (1) all-or-nothing assignment (AON), (2) stochastic multipath assignment (SM), and (3) user equilibrium assignment (UE). Numerical examples were given, along with the results of numerical tests in which larger networks were used. The conclusion was reached that even though the UE approach was, from a conceptual point of view, more likely to give the best assignments of trips to networks, in practice the incremental versions of both AON and SM assignment could often give better results. This was true regardless of whether the UE objective function was used as a criterion of the best, or whether the SO (minimum total transport cost) objective function was used.
