| 英文摘要 |
When a natural disaster occurs, the most important action for the government is to evacuate the victims as quickIy as possible. In practice, decision makers arrange evacuation vehicles and decide on the escape routes based on their own experience, which is neither efficient nor effective. Therefore, in this research, we utilize a time-space network-flow technique to construct an optimal routing and scheduling model for disaster evacuation. The model is formulated as an integer network flow problem with side constraints, which is characterized as NP-hard. A heuristic algorithm is developed to efficiently solve the large problems that occur in practice. Finally, we perform a case study using real data from a city in Taiwan. The results show that both the model and solution algorithm can be useful references for disaster evacuation in practice. When a natural disaster occurs, the most important action for the government in the duration of damage is to evacuate the victims rapidly. In practice, the decision makers arrange the evacuative vehicles and decide the escape routes based on their own experiences, which is neither efficient nor effective. Therefore, is research, we utilize a time-space network-flow technique to construct an optimal routing and scheduling model for disaster evacuation The model is formulated as an integer network flow problem with side constraints, which is characterized as NP-hard. To efficiently solve large problems that occur in practice, a heuristic algorithm is developed. Finally, we perform a case study using real data from a Taiwan city. The results show that the model and the solution algorithm could be useful references for disaster evacuation in practices. |
本站僅提供期刊文獻檢索。
