Abstract An equivalent continuous time optimal control problem is formulated to predict the temporal evolution of traffic flow pattern on a congested multiple origin-destination network, corresponding to a dynamic generalization of Wardropian user equilibrium. Optimality conditions are derived using the Pontryagin minimum principle and given economic interpretations, which are generalizations of similar results previously reported for single-destination networks. Analyses of sufficient conditions for optimality and of singular controls are also given. Under the steady-state assumptions, the model is shown to be a proper dynamic extension of Beckmann's mathematical programming problem for a static user equilibrium traffic assignment.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic user optimal traffic assignment on congested multidestination networks


    Contributors:

    Published in:

    Publication date :

    1990-01-01


    Size :

    12 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Dynamic User Equilibrium Traffic Assignment on Congested Multidestination Network

    Varia, H. R. / Dhingra, S. L. | British Library Online Contents | 2004


    Optimal control of multidestination traffic networks

    Papageorgiou, M. / Banos, J.C.M. | Tema Archive | 1990


    Dynamic Traffic Assignment in Congested Networks

    Bellei, G. / Bielli, M. / Italian National Research Council; Progetto Finalizzato Transporti et al. | British Library Conference Proceedings | 1996


    Dynamic Traffic Assignment in Congested Networks

    Bellei, Giuseppe / Bielli, Maurizio | Springer Verlag | 1996