Pre-planning of emergency rescue paths based on reliability analysis
A heuristic path searching and checking algorithm is suggested for the reduction of emergency response times, as well as reliance on the real-time post-disaster data. Using static link travel time estimation and reliability analysis for the road network, an approach to emergency pre-planning based on a partially disjoint candidate path set for each important origin-destination pair is proposed. A heuristic link weight increment method for finding partially disjoint path sets is introduced. By imposing constraints, it is ensured that every candidate path is both fast and reliable. Also the probability of joint failure of all candidate paths is reduced by introducing constraints on the extent of path overlaps. Finally, the efficiency of the pre-trip path computation is improved by choosing a better heuristic function in one of the algorithms. For the covering abstract see ITRD E140665.
-
Authors:
- CHEN, Y
- WAND, D
- BELL, M G
- Publication Date: 2007
Language
- English
Media Info
- Serial:
Subject/Index Terms
- TRT Terms: Calculation; Conferences; Emergencies; Incident detection; Incident management; Intelligent transportation systems; Travel time
- Subject Areas: Operations and Traffic Management; I72: Traffic and Transport Planning;
Filing Info
- Accession Number: 01163501
- Record Type: Publication
- Source Agency: Transport Research Laboratory
- Files: ITRD
- Created Date: Jul 22 2010 11:03AM