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.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Path-Based Algorithms to Solve C-Logit Stochastic User Equilibrium Assignment Problem


    Additional title:

    Transportation Research Record


    Contributors:


    Publication date :

    2012-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    Stochastic User-Equilibrium Formulations for Extended-Logit Assignment Models

    Prashker, J. N. / Bekhor, S. | Transportation Research Record | 1999


    Stochastic User-Equilibrium Formulations for Extended-Logit Assignment Models

    Prashker, J. N. / Bekhor, S. / Transportation Research Board | British Library Conference Proceedings | 1999