A network flow model for lane-based evacuation routing

作者: Thomas J. Cova , Justin P. Johnson

DOI: 10.1016/S0965-8564(03)00007-7

关键词:

摘要: 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 identifying optimal lane-based evacuation plans complex road network. The an integer extension of the minimum-cost problem. It can be used to generate that trade total vehicle travel-distance against merging, while preventing crossing-conflicts A mixed-integer programming solver derive sample Manual capacity analysis and microscopic simulation are compare relative efficiency plans. An application presented Salt Lake City, Utah.

参考文章(29)
F Southworth, Regional Evacuation Modeling: A State of the Art Reviewing Other Information: PBD: 1 Jan 1991. ,(1991) , 10.2172/814579
Horst A. Eiselt, Carl-Louis Sandblom, Integer Programming and Network Models ,(2000)
I Ismail, AN OVERVIEW OF TRAFFIC SAFETY IN JORDAN Ite Journal-institute of Transportation Engineers. ,vol. 58, ,(1988)
B.M. Vogt, J.H. Sorensen, Evacuation research: A reassessment ,(1992) , 10.2172/6816691
Lester A. Hoel, Nicholas J. Garber, Traffic and Highway Engineering ,(2007)
Lester Randolph Ford, Flows in networks ,(1962)
Mark Poch, Fred Mannering, Negative binomial analysis of intersection accident frequencies Journal of Transportation Engineering-asce. ,vol. 122, pp. 105- 113 ,(1996) , 10.1061/(ASCE)0733-947X(1996)122:2(105)
James B. Orlin, Thomas L. Magnanti, Ravindra K. Ahuja, Network Flows: Theory, Algorithms, and Applications ,(1993)