|
Title: Intersection Origin–Destination Flow Optimization Problem for Evacuation Network Design
Accession Number: 01334437
Record Type: Component
Record URL: Availability: Transportation Research Board Business Office 500 Fifth Street, NW Find a library where document is available Abstract: In a lane-based evacuation network design problem that incorporates lane reversal and crossing elimination strategies, the network can be virtually decomposed to a number of roadway subnetworks and intersection subnetworks. Lane reversal and crossing elimination are implemented on roadway subnetworks and intersection subnetworks, respectively. Although this network decomposition mechanism naturally offers an appealing algorithmic approach for network solutions by relaxing the crossing elimination constraints, one needs to consider—from the solution feasibility perspective—the mutual connectivity requirements imposed by the two capacity–reallocation and connectivity–reallocation network settings simultaneously. This paper considers an intersection origin–destination flow distribution problem arising from the evacuation network design and outputs whether the crossing elimination constraints are satisfied or violated given a lane reversal solution. The main contribution of this work is to provide a condition of network flows sufficient for the existence and validity of the problem and develop an efficient simplex-based method to obtain solutions to the problem. Numerical examples are provided to illustrate the method’s effectiveness and efficiency.
Monograph Accession #: 01362330
Report/Paper Numbers: 11-3645
Language: English
Authors: Xie, ChiWaller, S TravisKockelman, Kara MPagination: pp 105-115
Publication Date: 2011
ISBN: 9780309167529
Media Type: Print
Features: Figures
(7)
; References
(33)
TRT Terms: Uncontrolled Terms: Subject Areas: Highways; Planning and Forecasting; Security and Emergencies; I72: Traffic and Transport Planning
Files: TRIS, TRB, ATRI
Created Date: Feb 17 2011 6:35PM
More Articles from this Serial Issue:
|