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.
A network flow model for lane-based evacuation routing
Transportation Research Part A: Policy and Practice ; 37 , 7 ; 579-604
2002-12-08
26 pages
Article (Journal)
Electronic Resource
English
A network flow model for lane-based evacuation routing
Online Contents | 2003
|Lane-based multi-class vehicle collaborative evacuation management
Taylor & Francis Verlag | 2022
|