This paper reports on investigations into the application of several probit analytical methods to traffic assignment, considering their accuracy and computational cost and exploring the performance of several algorithms for the solution of the SUE assignment problem with one or multiple user classes. The remainder of the paper introduces the methods that can be used for solving the probit choice function; gives an overview of the analytical methods; presents the results of some numerical experiments carried out on artificial networks to test their accuracy and computational cost; presents a number of algorithms for solving the SUE traffic assignment problem with the approximation methods and reports on the use of similar algorithms to solve efficiently the SUE assignment when multiple user classes are considered. (Author/publisher) For the covering entry of this conference, please see ITRD abstract No. E208120.
Abstract