Network representation,continuum approximations and a solution to the spatial aggregation problem of traffic assignment

This paper complements the preceding one, which showed how one could modify equilibrium traffic assignment algorithms for networks with many centroids. In this one it is shown how one can substitute centroids by zones with continuous population densities. The technique, which is mathematically guaranteed to approximate a flow pattern in accordance with Wardrop's user equilibrium criterion, requires some geometrical calculations which can be handled off-line. With the suggested approach, it is possible to represent the spatial distribution of trip ends more realistically and this allows traffic assignment models to capture the effects of short and intrazonal trips in a way previously impossible. The method is shown to be computationally feasible.