Abstract We consider a bicriterion traffic assignment model where the network users have different values of time. We present an infinite-dimensional formulation of this model that lends itself to an extremely simple and efficient algorithm that takes into account the network structure of the problem.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An Efficient Algorithm for a Bicriterion Traffic Assignment Problem


    Beteiligte:
    Marcotte, Patrice (Autor:in) / Zhu, Daoli (Autor:in)


    Erscheinungsdatum :

    01.01.1996


    Format / Umfang :

    11 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    An Efficient Algorithm for a Bicriterion Traffic Assignment Problem

    Marcotte, P. / Zhu, D. / Italian National Research Council; Progetto Finalizzato Transporti et al. | British Library Conference Proceedings | 1996




    Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms

    Dial, R. B. | British Library Online Contents | 1996