Effective evacuation route planning algorithms by updating earliest arrival time of multiple paths

Abstract

More and more natural disasters are happening around the globe and in such urgent situations, effective evacuation planning is one of the most critical tools for human safety. Evacuation planning algorithms are different from traditional network routing algorithms in the sense that the objective is to minimize the time when the last evacuee arrives at the destination. Among the existing evacuation planning algorithms, CCRP++ finds good solutions but its computation time is not scalable in terms of the number of the evacuees. In addition, in order to improve the computation time from the base algorithm CCRP, CCRP++ makes non-global up-date of earliest arrival time of each source node which results in unnecessarily large evacuation time.

Cite this paper

@inproceedings{min2014effective,
  title = {Effective evacuation route planning algorithms by updating earliest arrival time of multiple paths},
  author = {Manki Min and Jonguk Lee and Sunho Lim},
  booktitle = {International Workshop on Mobile Geographic Information Systems},
  year = {2014},
  doi = {10.1145/2675316.2675326}
}