This paper develops path-based algorithms to solve the C-logit stochastic user equilibrium (SUE) problem on the basis of an adaptation of the gradient projection method. The algorithms' strategies for step size determination differ. Three strategies are investigated: (a) predetermined step size, (b) Armijo line search, and (c) self-adaptive line search. The algorithms are tested on the well-known Winnipeg (Manitoba, Canada) network. Two sets of experiments are conducted: (a) a computational comparison of different line search strategies and (b) the impact of different modeling specifications for route overlapping (a flow-independent or a flow-dependent commonality factor). The results indicate that the path-based algorithm with the self-adaptive step size strategy performs better than the other step size strategies. The paper shows that, depending on the model parameters, particularly the commonality factor parameter, the C-logit SUE flows may be quite different from the multinomial logit SUE flows.
Path-Based Algorithms to Solve C-Logit Stochastic User Equilibrium Assignment Problem
Transportation Research Record
Transportation Research Record: Journal of the Transportation Research Board ; 2279 , 1 ; 21-30
2012-01-01
Article (Journal)
Electronic Resource
English
Path-Based Algorithms to Solve C-Logit Stochastic User Equilibrium Assignment Problem
Online Contents | 2012
|Algorithms for logit-based stochastic user equilibrium assignment
Online Contents
|Stochastic User-Equilibrium Formulations for Extended-Logit Assignment Models
Online Contents | 1999
|Stochastic User-Equilibrium Formulations for Extended-Logit Assignment Models
Transportation Research Record | 1999
|Stochastic User-Equilibrium Formulations for Extended-Logit Assignment Models
British Library Conference Proceedings | 1999
|