In this paper, a combined model of auto-transit assignment is introduced based on two complementarity formulations in the literature. The model accounts for interactions between the auto and transit modes through non-separable asymmetric demand and cost functions. A path-based solution algorithm is presented based on the three ideas of decomposition, column generation, and linearization, which have proved to be effective in tackling large-size networks. Numerical results over the Chicago sketch network suggest that the algorithm converges quickly within the first iterations, but is less effective as the solution gets closer to the neighborhood of the equilibrium solution. The sluggish convergence behavior is attributed to the difficulty of searching the space of strategy-based transit assignment model.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Complementarity Formulation and Solution Algorithm for Auto-Transit Assignment Problem


    Additional title:

    Transportation Research Record


    Contributors:


    Publication date :

    2019-03-03




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Algorithm for Equilibrium Transit Assignment Problem

    Babazadeh, Abbas / Aashtiani, Hedayat Z. | Transportation Research Record | 2005


    Algorithm for Equilibrium Transit Assignment Problem

    Babazadeh, Abbas | Online Contents | 2005


    Algorithm for Equilibrium Transit Assignment Problem

    Babazadeh, Abbas / Aashtiani, Hedayat | Transportation Research Record | 2005