Short and Reliable Path Selection for Automatic Evacuation Guiding Based on Interactions Between Evacuees and Their Mobile Devices

When large-scale disasters occur, evacuees have to evacuate to a refuge quickly. For this purpose, there has been proposed an automatic evacuation guiding scheme based on implicit interactions among evacuees, their mobile devices, and networks. In this scheme, an evacuation route is obtained as the shortest path, which may not be safe. In this paper, we propose a short and reliable path selection for existing automatic evacuation guiding, which allows evacuees to evacuate quickly while avoiding encounters with blocked road segments as much as possible. First, the proposed scheme calculates k-shortest \((k \ge 1)\) paths from the current location to the destination, with the help of the existing algorithm. Then, it selects the most reliable one from the candidates by taking into account road blockage probabilities, each of which is an estimated probability that the corresponding road is blocked under a certain disaster. Through simulation experiments, we show that the proposed scheme can reduce the number of encounters with blocked road segments with an appropriate value of k, while keeping the average/maximum evacuation time compared with the shortest path selection.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Mohammad Saadatseresht,et al.  Evacuation planning using multiobjective evolutionary optimization approach , 2009, Eur. J. Oper. Res..

[3]  Ciprian Dobre,et al.  Big Data and Internet of Things: A Roadmap for Smart Environments , 2014, Big Data and Internet of Things.

[4]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[5]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[6]  Masahiro Sasabe,et al.  Automatic evacuation guiding scheme based on implicit interactions between evacuees and their mobile nodes , 2016, GeoInformatica.

[7]  Yasunori Iida,et al.  BASIC CONCEPTS AND FUTURE DIRECTIONS OF ROAD NETWORK RELIABILITY ANALYSIS , 1999 .

[8]  Shashi Shekhar,et al.  Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results , 2005, SSTD.

[9]  Akihiro Fujihara,et al.  Disaster Evacuation Guidance Using Opportunistic Communication: The Potential for Opportunity-Based Service , 2014, Big Data and Internet of Things.

[10]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[11]  M. Kwan,et al.  A model for evacuation risk assessment with consideration of pre- and post-disaster factors , 2012, Comput. Environ. Urban Syst..

[12]  Richard L. Church,et al.  Mapping evacuation risk on transportation networks using a spatial optimization model , 2000 .

[13]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[14]  Takuya Akiba,et al.  Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling , 2015, AAAI.

[15]  Yuan Yuan,et al.  Path selection model and algorithm for emergency logistics management , 2009, Comput. Ind. Eng..

[16]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[17]  Hong Kam Lo,et al.  Capacity reliability of a road network: an assessment methodology and numerical results , 2002 .

[18]  Kayo Iizuka,et al.  An Effective Disaster Evacuation Assist System Utilized by an Ad-Hoc Network , 2011, HCI.