AbstractThis paper presents a novel user-equilibrium (UE) traffic assignment algorithm, which under conventional assumptions, promises to compute UE arc flows to acceptable precision, regardless of the network’s topology, size or congestion:The algorithm takes the simple approach of shifting flow from a costliest path to a cheapest path until the costs of all used paths are within a given &z.epsi; of the cheapest.Because of being path-based, it avoids tailing.In spite of being path-based, it neither stores nor enumerates paths.These efficiencies derive from decomposing the problem into a sequence of easy single-origin problems on acyclic sub-networks.Solutions to this sequence of sub-network flows converge rapidly to a sharp practical estimate of UE arc flows—as is amply demonstrated by tests using the Chicago region’s 40,000-arc network model.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2006-01-01


    Format / Umfang :

    20 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    A modified logit assignment model which obviates enumeration and overlapping problems

    Russo, F. / Vitettta, A. / Association for European Transport | British Library Conference Proceedings | 2000



    Stochastic User Equilibrium Assignment with Explicit Path Enumeration: Comparison of Models and Algorithms

    Cascetta, E. / Russo, F. / Vitetta, A. et al. | British Library Conference Proceedings | 1997