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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Efficient Algorithm for a Bicriterion Traffic Assignment Problem


    Contributors:


    Publication date :

    1996-01-01


    Size :

    11 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    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