This report deals with socalled probit-type trip assignment models for uncongested situations, giving special attention to stochastic simulation approaches for complete networks. This class of assignment models is typified vis-a-vis other assignment approaches for uncongested problems. A detailed description and critical analysis is given of the behavioural foundations of this model type using the random-utility discrete-choice theory as a starting point.
Abstract