.png){kind=icon}
.png){kind=icon}
Return
Evacuation planning for disaster responses: A stochastic programming framework
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2016.05.022.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Some disasters such as earthquakes, floods and hurricanes may result in evacuation for people in an affected area. This paper focuses on finding the a priori evacuation plans by considering side constraints and scenario-based stochastic link travel times and capacities. Hence a stochastic programming framework is developed so as to provide a reorganization of the traffic routing for a disaster response. Considering the different preferences of decision-makers, three evaluation criteria are introduced to formulate the objective function. Crisp linear equivalents for different evacuation strategies are further deduced to simplify solution methodologies. A heuristic algorithm combining the Lagrangian relaxation-based approach with K-shortest path techniques is designed to solve the expected disutility model. The experimental results indicate that the algorithm can solve large-scale instances for the problem of interest efficiently and effectively. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Evacuation
Stochastic programming
Side constraint
Relaxation-based heuristic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.9
Papers:
4.7K
Citations:
3.2W