A study on logit assignment which excludes all cyclic flows

This paper first studies the Van Vliet formula in calculating the link choice probabilities for the logit assignment without cyclic flows. We show that this formula may still contain the cyclic flow contribution although the node-to-node weights matrix used in it does not. The correct formula is provided but with the need for path enumeration. The paper then presents an efficient approach to generate all non-looping paths and applies it to solve stochastic user equilibrium problem in conjunction with the method of successive averages. A numerical example is used to validate our study.

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

[2]  T de la Barra,et al.  Multidimensional path search and assignment , 1993 .

[3]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

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

[5]  Hai-Jun Huang.  A Combined Algorithm for Solving and Calibrating the Stochastic Traffic Assignment Model , 1995 .

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

[7]  Takashi Akamatsu,et al.  Decomposition of Path Choice Entropy in General Transport Networks , 1997, Transp. Sci..

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

[9]  Gary A. Davis,et al.  Exact local solution of the continuous network design problem via stochastic user equilibrium assignment , 1994 .

[10]  M. Bell,et al.  A TIME-DEPENDENT MULTI-CLASS PATH FLOW ESTIMATOR , 1996 .

[11]  Michael Patriksson,et al.  An algorithm for the stochastic user equilibrium problem , 1996 .

[12]  Warrren B Powell,et al.  The Convergence of Equilibrium Algorithms with Predetermined Step Sizes , 1982 .

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

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

[15]  M G H Bell.  STOCHASTIC USER EQUILIBRIUM ASSIGNMENT AND ITERATIVE BALANCING. , 1993 .

[16]  Dirck Van Vliet.  Selected node-pair analysis in dial's assignment algorithm , 1981 .