K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks

Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:PloS one Ročník 10; číslo 7; s. e0131962
Hlavní autoři: He, Yunyue, Liu, Zhong, Shi, Jianmai, Wang, Yishan, Zhang, Jiaming, Liu, Jinyuan
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States Public Library of Science 30.07.2015
Public Library of Science (PLoS)
Témata:
Accidents, Traffic
Algorithms
Analysis
Cities
Civil Defense
Civilian evacuation
Computer applications
Computer Simulation
Disaster Planning - methods
Efficiency
Emergencies
Emergency preparedness
Emergency Shelter - methods
Emergency vehicles
Engineering
Evacuation
Evacuation routing
Evacuations & rescues
Heuristic
Heuristic methods
Humans
Information systems
Integer programming
International conferences
Laboratories
Linear programming
Linearization
Models, Theoretical
Optimization
Police
Resource Allocation
Resource utilization
Roads & highways
Route planning
Routing
Science
Shelters
Shortest-path problems
Traffic accidents
Traffic accidents & safety
Traffic congestion
Transportation - methods
Transportation industry
Transportation networks
Transportation planning
Urban transportation
ISSN:1932-6203, 1932-6203
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based technique that uses explicit congestion control to optimize evacuation routing and police resource allocation. A nonlinear mixed-integer programming model is presented to formulate the problem. The model's objective is to minimize the overall evacuation clearance time. Two algorithms are given to solve the problem. The first one linearizes the original model and solves the linearized problem with CPLEX. The second one is a heuristic algorithm that uses a police resource utilization efficiency index to directly solve the original model. This police resource utilization efficiency index significantly aids in the evaluation of road links from an evacuation throughput perspective. The proposed algorithms are tested with a number of examples based on real data from cities of different sizes. The computational results show that the police resource utilization efficiency index is very helpful in finding near-optimal solutions. Additionally, comparing the performance of the heuristic algorithm and the linearization method by using randomly generated examples indicates that the efficiency of the heuristic algorithm is superior.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-3
content type line 23
ObjectType-Review-1
Conceived and designed the experiments: YH JS ZL. Performed the experiments: YH ZL YW. Analyzed the data: YH JS JZ. Contributed reagents/materials/analysis tools: YH JL. Wrote the paper: YH JS YW JZ.
Competing Interests: The authors have declared that no competing interests exist.
ISSN:1932-6203
1932-6203
DOI:10.1371/journal.pone.0131962