A variety of macroscopic traffic flow models have been applied to formulate the link-based system optimal dynamic traffic assignment (SO-DTA) problem in a many-to-one network. It is expected that SO-DTA models based on various traffic flow models usually result in different optimal link traffic evolution patterns, but whether and how traffic flow models affect the minimal system cost and the corresponding optimal arrival pattern at the destination is unclear. Three traffic flow models–point-queue, spatial-queue, and cell-transmission–are examined, and their resulted minimal system cost in many-to-one networks is compared. It is proved that for three simple networks–a linear network with two sequential bottlenecks, a two-in-one-out merge network, and a one-in-two-out diverge network–the minimal system costs for the SO-DTA models based on these three traffic flow models are identical. Numerical experiments show that this property appears to be held for general many-to-one networks. The reason may be that all three traffic flow models propagate the uncongested flows at the same speed and release the congested flows always at the link capacity. In SO-DTA applications where only the minimal system cost or arrival pattern at the destination is of major interest, the findings can be utilized to substantially expedite the solution procedure.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    What Do Different Traffic Flow Models Mean for System-Optimal Dynamic Traffic Assignment in a Many-to-One Network?


    Additional title:

    Transportation Research Record


    Contributors:
    Shen, Wei (author) / Zhang, H. M. (author)


    Publication date :

    2008-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    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


    Analysis of Traffic Models for Dynamic Equilibrium Traffic Assignment

    Heydecker, B. G. / Addison, J. D. / Association of European Operational Research Societies | British Library Conference Proceedings | 1998