The study of dynamic route guidance model over a general road network has been deployed for some time in intelligent transportation systems (ITS) field. The paper presents the general formulation of the system optimal dynamic traffic assignment (DTA) problems, and enunciates the discrete form model. For the sake of computational convenience, the simplification of the model is explored according to the characteristics of realistic traffic system. Then the algorithm base on Lagrangian relaxation and quasi-Newton iteration is given to solve the simplified problem. Simulation is carried out to show the practicability and efficiency of the algorithm. Moreover some analysis on the simulation and guidance for future studies are presented at the end.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An efficient solution to the system optimum dynamic traffic assignment problems based on Lagrangian relaxation


    Contributors:
    Jing Dong, (author) / Bing Xia, (author) / Jiang-tao Ren, (author) / Zuo Zhang, (author) / Dan-ya Yao, (author)


    Publication date :

    2002-01-01


    Size :

    389192 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    AN EFFICIENT SOLUTION TO THE SYSTEM OPTIMUM DYNAMIC TRAFFIC ASSIGNMENT PROBLEMS BASED ON LAGRANGIAN RELAXATION

    Dong, J. / Xia, B. / Ren, J.-T. et al. | British Library Conference Proceedings | 2002




    On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems

    Zheng, H. / Chiu, Y.-C. / Mirchandani, P.B. | British Library Online Contents | 2015


    A Study on Dynamic System Optimum Traffic Assignment

    Lu, H. / Yin, Y. | British Library Conference Proceedings | 1998