AbstractMost traffic delays in regional evacuations occur at intersections. Lane-based routing is one strategy for reducing these delays. This paper presents a network flow model for identifying optimal lane-based evacuation routing plans in a complex road network. The model is an integer extension of the minimum-cost flow problem. It can be used to generate routing plans that trade total vehicle travel-distance against merging, while preventing traffic crossing-conflicts at intersections. A mixed-integer programming solver is used to derive optimal routing plans for a sample network. Manual capacity analysis and microscopic traffic simulation are used to compare the relative efficiency of the plans. An application is presented for Salt Lake City, Utah.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A network flow model for lane-based evacuation routing


    Beteiligte:


    Erscheinungsdatum :

    08.12.2002


    Format / Umfang :

    26 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    A network flow model for lane-based evacuation routing

    Cova, Thomas J. | Online Contents | 2003



    Multipurpose lane divider for evacuation slide

    HAYNES TIMOTHY C / HARTMAN DREW | Europäisches Patentamt | 2018

    Freier Zugriff

    Lane-based multi-class vehicle collaborative evacuation management

    Liu, Jialin / Jiang, Rui / Li, Xingang et al. | Taylor & Francis Verlag | 2022