Abstract
A family of algorithms for assigning trips onto a road network is developed based on stochastic models of route choice which explicitly allow non minimum cost routes to be used. Several alternative formulations are identified and compared both from a theoretical point of view and by a series of tests on a representative London network. As a result of these a "best" choice is given.