Algorithms for logit-based stochastic user equilibrium assignment

The paper proposes an efficient algorithm for determining the stochastic user equilibrium solution for logit-based loading. The commonly used Method of Successive Averages typically has a very slow convergence rate. The new algorithm described here uses Williams' result [ Williams, (1977) On the formation of travel demand models and economic evaluation measures of user benefit. Environment and Planning 9A(3), 285-344] which enables the expected value of the perceived travel costs Srs to be readily calculated for any flow vector x. This enables the value of the Sheffi and Powell, 1982 objective function [Sheffi, Y. and Powell, W. B. (1982) An algorithm for the equilibrium assignment problem with random link times. Networks 12(2), 191-207], and its gradient in any specified search direction, to be calculated. It is then shown how, at each iteration, an optimal step length along the search direction can be easily estimated, rather than using the pre-set step lengths, thus giving much faster convergence. The basic algorithm uses the standard search direction (towards the auxiliary solution). In addition the performance of two further versions of the algorithm are investigated, both of which use an optimal step length but alternative search directions, based on the Davidon-Fletcher-Powell function minimisation method. The first is an unconstrained and the second a constrained version. Comparisons are made of all three versions of the algorithm, using a number of test networks ranging from a simple three-link network to one with almost 3000 links. It is found that for all but the smallest network the version using the standard search direction gives the fastest rate of convergence. Extensions to allow for multiple user classes and elastic demand are also possible.

[1]  F. Leurent.  Curbing the computational difficulty of the logit equilibrium assignment model , 1997 .

[2]  M J Maher.  SAM - A STOCHASTIC ASSIGNMENT MODEL , 1992 .

[3]  Takashi Akamatsu,et al.  Cyclic flows, Markov process and stochastic traffic assignment , 1996 .

[4]  C. Fisk.  Some developments in equilibrium traffic assignment , 1980 .

[5]  M. J. Maher,et al.  Estimation of the Potential Benefits from an ATT System Using a Multiple User Class Stochastic User Equilibrium Assignment Model , 1996 .

[6]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[7]  Tom van Vuren,et al.  MULTIPLE USER CLASS ASSIGNMENT MODEL FOR ROUTE GUIDANCE , 1991 .

[8]  P. C. Hughes,et al.  AN ALGORITHM FOR SUEED - STOCHASTIC USER EQUILIBRIUM WITH ELASTIC DEMAND , 1997 .

[9]  Carlos F. Daganzo,et al.  Multinomial Probit: The Theory and its Application to Demand Forecasting. , 1980 .

[10]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[11]  A. Alfa,et al.  Algorithms for solving fisk's stochastic traffic assignment model , 1991 .

[12]  Warren B. Powell,et al.  An algorithm for the equilibrium assignment problem with random link times , 1982, Networks.

[13]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[14]  H. Williams.  On the Formation of Travel Demand Models and Economic Evaluation Measures of User Benefit , 1977 .

[15]  E. Cascetta,et al.  A MODIFIED LOGIT ROUTE CHOICE MODEL OVERCOMING PATH OVERLAPPING PROBLEMS. SPECIFICATION AND SOME CALIBRATION RESULTS FOR INTERURBAN NETWORKS , 1996 .

[16]  M. Bell.  Alternatives to Dial's logit assignment algorithm , 1995 .

[17]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[18]  P. Hughes,et al.  A PROBIT-BASED STOCHASTIC USER EQUILIBRIUM ASSIGNMENT MODEL , 1997 .

[19]  L. E. Scales,et al.  Introduction to Non-Linear Optimization , 1985 .

[20]  Attahiru Sule Alfa,et al.  A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach , 1991, Transp. Sci..