A network flow model for lane-based evacuation routing

Thomas J. Cova and Justin P. Johnson

Transportation Research Part A: Policy and Practice, 2003, vol. 37, issue 7, 579-604

Abstract: Most 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.

Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (66)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0965-8564(03)00007-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transa:v:37:y:2003:i:7:p:579-604

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part A: Policy and Practice is currently edited by John (J.M.) Rose

More articles in Transportation Research Part A: Policy and Practice from Elsevier
Bibliographic data for series maintained by Catherine Liu ().