This paper presents a hybrid framework for Dynamic Traffic Assignment (DTA) problems. The Hybrid DTA problem (HDTA) is modeled as a Stackelberg Game, in which the Centralized DTA (CDTA) model is considered as the game leader and the Decentralized DTA (DDTA) model is the follower. Central to the analysis is the algorithm that provides approximate solution for the assignment problem in a realistic size network. Experiments are conducted and the solution features of the HDTA model are discussed.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Toward hybrid dynamic traffic assignment-models and solution procedures


    Contributors:


    Publication date :

    2001-01-01


    Size :

    899709 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Toward Hybrid Dynamic Traffic Assignment - Models and Solution Procedures

    Chiu, Y. / Mahmassani, H. S. / IEEE | British Library Conference Proceedings | 2001


    Dynamic Traffic Assignment Models

    Drissi-Kaïtouni, Omar | Springer Verlag | 1992


    Microsimulation-based procedures for dynamic network traffic assignment

    Mahmassani, H. S. / Hu, T.-Y. / Peeta, S. et al. | British Library Conference Proceedings | 1994


    Traffic Models for Dynamic Assignment

    Addison, J. D. / Heydecker, B. G. | British Library Conference Proceedings | 1992


    Traffic models for dynamic assignment

    Addison, J. D. / Heydecker, B. G. / Universities Transport Study Group | British Library Conference Proceedings | 1992