CONTACT US: Contact info
|
Citation |
Sivanandan R, Hobeika AG, Ardekani SA, Lockwood PB. Transp. Res. Rec. 1988; 1168: 86-91. |
|
Copyright |
(Copyright © 1988, Transportation Research Board, National Research Council, National Academy of Sciences USA, Publisher SAGE Publishing) |
|
DOI |
unavailable |
PMID |
unavailable |
|
Abstract |
The immediate needs of a city struck by a disaster are quick and safe evacuation of its inhabitants and prompt search and rescue operations conducted by emergency personnel. If the city's road network has suffered capacity losses because of floods, building rubble, or structural failures, a shortest-path algorithm with the aid of a computer serves as a useful tool in assigning the emergency vehicles to routes that remain open in the aftermath of the disaster. It the city network is large, the shortest-path algorithms consume large memory and execution time on a microcomputer. If the algorithm needs to operate in real-time conditions, the savings in these factors become very important. Heuristic methods have been developed to reduce the computer storage and execution time. One such heuristic method is being examined for its accuracy compared with conventional shortest-path algorithms, which build the entire shortest-path tree before selecting the path between an origin-destination pair. The suggested heuristic method alleviates the need to build the entire tree, yet proved to yield the same results as the total-path enumeration method in 99 percent of the cases when applied to the Mexico City network. Language: en |
|
Keywords |
Vehicles; Urban Planning; Roads and Streets; Computer Programming--Algorithms; Street Traffic Control--Emergency Measures; Systems Science and Cybernetics--Heuristic Programming |