Equilibrium traffic assignment with two vehicle types

This paper considers the steady-state equilibrium assignment problem in which two types of vehicle (car and lorry, say) share the same network. It is already known that standard algorithms are guaranteed to solve multi-class equilibrium assignment models which allow for differing perceptions of fixed costs, and differing perceptions of costs due to congestion delays; provided the congestion delays are determined according to the usual p.c.u. framework. It is shown here that a relatively new monotonicity algorithm is guaranteed to solve multi-class equilibrium assignment models which also allow a wide range of linear interactions between different vehicle types.