PERMS: An efficient rescue route planning system in disasters

Abstract The occurrence of natural and man-made disasters usually leads to significant social and economic disruption, as well as high numbers of casualties. Such occurrences are difficult to predict due to the huge number of parameters with mutual interdependencies which need to be investigated to provide reliable predictive capabilities. In this work, we present high-Performance Emergent Rescue Management e-System (PERMS), an efficient rescue route planning scheme operating within a high-performance emergent rescue management system for vehicles based on the mobile cloud computing paradigm. More specifically, an emergency rescue planning problem (ERRP) is investigated as a multiple travelling salesman problem (MTSP), as well as a novel phased heuristic rescue route planning scheme. This consists of an obstacle constraints and task of equal division-based K-means++ clustering algorithm (OT-K-means++), which is more suitable for clustering victims in disaster environments, and a glow-worm swarm optimisation algorithm based on chaotic initialisation (GSOCI), which provides the appropriate rescue route for each vehicle. A prototype is developed to evaluate the performance of this proposed approach, which demonstrates a better performance compared to other well-known and widely used algorithms. As demonstrated by the validation process, our approach enhances the accuracy and convergence speed for solving the emergency rescue planning problem. Furthermore, it shortens the length of the rescue route, as well as rescue time, and it leads to reasonable and balanced allocation of emergency rescue tasks, whilst achieving an overall efficient rescue process. More specifically, by considering scenarios with 200 victims, compared with K-means and K-means++, OT-K-means++ reduces the time cost of clustering by 9.52% and 17.39% respectively, and reduces the number of iterations by 11.11% and 15.78% respectively. Compared with ACO or GA, GSOCI reduces the length of rescue route by 9.81% and 16.36% respectively, and reduces the time of rescue by 4.35% and 15.38% respectively.

[1]  Debasish Ghose,et al.  Glowworm swarm optimisation: a new method for optimising multi-modal functions , 2009, Int. J. Comput. Intell. Stud..

[2]  Mazliza Othman,et al.  A Survey of Mobile Cloud Computing Application Models , 2014, IEEE Communications Surveys & Tutorials.

[3]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[4]  Mingli Song,et al.  An improvement of partheno-genetic algorithm to solve multiple travelling salesmen problem , 2016, 2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS).

[5]  Nik Bessis,et al.  Buildings and Crowds: Forming Smart Cities for More Effective Disaster Management , 2011, 2011 Fifth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing.

[6]  Fatos Xhafa,et al.  Scanning Environments with Swarms of Learning Birds: A Computational Intelligence Approach for Managing Disasters , 2011, 2011 IEEE International Conference on Advanced Information Networking and Applications.

[7]  Zhou Zhou,et al.  A novel method of transformer fault diagnosis based on k-mediods and decision tree algorithm , 2017, 2017 1st International Conference on Electrical Materials and Power Equipment (ICEMPE).

[8]  Rajat Kumar Pal,et al.  A genetic ant colony optimization based algorithm for solid multiple travelling salesmen problem in fuzzy rough environment , 2017, Soft Comput..

[9]  Xin Chen,et al.  A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems , 2017, Appl. Soft Comput..

[10]  Maozhen Li,et al.  CLOTHO: A Large-Scale Internet of Things-Based Crowd Evacuation Planning System for Disaster Management , 2018, IEEE Internet of Things Journal.

[11]  Pierre T. Kabamba,et al.  Stability of Solutions to Classes of Traveling Salesman Problems , 2016, IEEE Transactions on Cybernetics.

[12]  Daniel Gutiérrez-Reina,et al.  An evolutionary computation approach for optimizing connectivity in disaster response scenarios , 2013, Appl. Soft Comput..

[13]  Francesco Palmieri,et al.  A cloud-based architecture for emergency management and first responders localization in smart city environments , 2016, Comput. Electr. Eng..

[14]  Xin Qiu,et al.  An opposition-based self-adaptive differential evolution with decomposition for solving the multiobjective multiple salesman problem , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[15]  Daniel Gutiérrez-Reina,et al.  Modelling and assessing ad hoc networks in disaster scenarios , 2013, J. Ambient Intell. Humaniz. Comput..

[16]  Mustaqeem,et al.  Att-Net: Enhanced emotion recognition system using lightweight self-attention module , 2021, Appl. Soft Comput..

[17]  Mayank Baranwal,et al.  Multiple traveling salesmen and related problems: A maximum-entropy principle based approach , 2017, 2017 American Control Conference (ACC).

[18]  Yu He,et al.  A Novel Particle Swarm Optimization for Multi-Objective Vehicle Routing Problem , 2016 .

[19]  Jinzhao Wu,et al.  A discrete invasive weed optimization algorithm for solving traveling salesman problem , 2015, Neurocomputing.

[20]  Adel M. Alimi,et al.  A new Hybrid Discrete Bat Algorithm for Traveling Salesman Problem using ordered crossover and 3-Opt operators for Bat's local search , 2015, 2015 15th International Conference on Intelligent Systems Design and Applications (ISDA).

[21]  Zhiwei Ye,et al.  An Optimization Model for Evacuation Based on Cellular Automata and Ant Colony Algorithm , 2014, 2014 Seventh International Symposium on Computational Intelligence and Design.

[22]  Rajkumar Buyya,et al.  Cloud-Based Augmentation for Mobile Devices: Motivation, Taxonomies, and Open Challenges , 2013, IEEE Communications Surveys & Tutorials.

[23]  Tohru Kohda,et al.  Chaotic Binary Sequences by Chebyshev Maps and Their Correlation Properties , 1992, IEEE Second International Symposium on Spread Spectrum Techniques and Applications.

[25]  Robert Till,et al.  Optimizing an agent-based traffic evacuation model using genetic algorithms , 2015, 2015 Winter Simulation Conference (WSC).

[26]  S. Gorenstein.  Printing Press Scheduling for Multi-Edition Periodicals , 1970 .

[27]  Athanasios V. Vasilakos,et al.  Secure Biometric-Based Authentication Scheme Using Chebyshev Chaotic Map for Multi-Server Environment , 2018, IEEE Transactions on Dependable and Secure Computing.

[28]  Daniel Gutiérrez-Reina,et al.  Multi-objective performance optimization of a probabilistic similarity/dissimilarity-based broadcasting scheme for mobile ad hoc networks in disaster response scenarios , 2014, Soft Comput..

[29]  Juraj Spalek,et al.  Automatic tuning of a fuzzy meta-model for evacuation speed estimation , 2016, 2016 Cybernetics & Informatics (K&I).

[30]  Nik Bessis,et al.  Extraction, Identification, and Ranking of Network Structures from Data Sets , 2014, 2014 Eighth International Conference on Complex, Intelligent and Software Intensive Systems.

[31]  M. Anwar Ma'sum,et al.  Design of intelligent k-means based on spark for big data clustering , 2016, 2016 International Workshop on Big Data and Information Security (IWBIS).

[32]  Muhammad Sajjad,et al.  Clustering-Based Speech Emotion Recognition by Incorporating Learned Features and Deep BiLSTM , 2020, IEEE Access.

[33]  Debasish Ghose,et al.  Theoretical foundations for rendezvous of glowworm-inspired agent swarms at multiple locations , 2008, Robotics Auton. Syst..

[34]  Mustaqeem,et al.  A CNN-Assisted Enhanced Audio Signal Processing for Speech Emotion Recognition , 2019, Sensors.

[35]  Fatos Xhafa,et al.  The Big Picture, from Grids and Clouds to Crowds: A Data Collective Computational Intelligence Case Proposal for Managing Disasters , 2010, 2010 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing.

[36]  Xueqiang Gu,et al.  Cooperative trajectory planning for multi-UCAV using multiple traveling salesman problem , 2016, CCC 2016.