@article{ref1,
title="A network flow model for lane-based evacuation routing",
journal="Transportation research part A: policy and practice",
year="2003",
author="Cova, Thomas J. and Johnson, Justin P.",
volume="37",
number="7",
pages="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.<p />",
language="en",
issn="0965-8564",
doi="10.1016/S0965-8564(03)00007-7",
url="http://dx.doi.org/10.1016/S0965-8564(03)00007-7"
}