Citation

Cova TJ, Johnson JP. Transp. Res. A Policy Pract. 2003; 37(7): 579-604.

Copyright

(Copyright © 2003, Elsevier Publishing)

DOI

10.1016/S0965-8564(03)00007-7

PMID

unavailable

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.