Aug 2026· Advances in Artificial Intelligence Research· 0 citations· 27 references
TL;DR
The principal finding is that the incremental solution yields a higher objective value than the static approach solving the same data in a single pass, showing that the locked field state preserves operational continuity without sacrificing solution quality.
Abstract
The assignment of a limited number of search and rescue (SAR) personnel to multiple, geographically dispersed disaster sites is a critical decision problem that directly determines the effectiveness of the initial response. Although this problem extends the classical assignment problem, the multidimensional nature of disaster operations cannot be adequately captured by single criterion distance minimization. In this study, the problem is modeled around a unified objective function (Φ) that integrates personnel competence, travel proximity, disaster demand, coverage ratio, and operational team cohesion. Under this common objective, Mixed Integer Linear Programming (LP/MILP) and four nature-inspired metaheuristics (Grey Wolf Optimizer, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization) are evaluated within a fair comparison framework. The method's dynamic incremental data mechanism also allows for the addition of reinforcement personnel arriving after the initial assignment and newly reported crash areas, while previously applied assignments remain locked. The method is validated on an urban earthquake scenario for the Çukurova district of Adana province, inspired by the 2023 Kahramanmaraş earthquakes. Across four scenarios representing a gradual transition from initial response to full capacity containing three disaster types, a total of 600 runs are evaluated using descriptive statistics, non-parametric hypothesis tests (the Friedman test and the Nemenyi post-hoc test), and convergence and sensitivity analyses. The principal finding is that the incremental solution (Φ = 0.8471) yields a higher objective value than the static approach solving the same data in a single pass (Φ = 0.8255), showing that the locked field state preserves operational continuity without sacrificing solution quality.
In maritime search and rescue (SAR) operations, the estimated location of survivors spreads over time, causing the search area to expand continuously. Deploying limited search and rescue units (SRUs) efficiently is critical, but as the search area grows, the number of possible deployment combinations increases exponent...
Tae-Hoon Kim, H. Jeong, Choong-ki Kim et al.· GECCO Companion· 0 citations
In disaster-relief logistics, disrupted ground transportation networks and the limited payload and endurance of UAVs make it difficult to allocate emergency materials across geographically dispersed demand points. This study formulates a capacity-constrained bi-objective multi-UAV material distribution problem that sim...
Jian Shang, Heng Li, En-Zhong Li et al.· Frontiers in Future Transpor...· 0 citations
P-MWFCM-ACO is proposed, a two-phase framework that integrates, for the first time, priority weights derived from an empirically validated survival probability model into the clustering phase of MRTA, providing the first empirical evidence that integrating medical triage models into the clustering phase of MRTA signifi...
Abdullah Osman, Tarık Küçükdeniz· Evolutionary Intelligence· 0 citations
A new set of objective functions to maximize the number of detected victims in the earliest stages of the search while minimizing completion time is proposed and a new solution representation is introduced together with problem-specific mutation operators.
S. Stachura, Jakub A. Grzeszczak, Artur Mikitiuk et al.· GECCO Companion· 0 citations
A Multi-Agent Disaster Management Simulator that automates the disaster response process using intelligent software agents, machine learning, graph-based routing, and generative artificial intelligence.
Hemanth S, Manoj M, Harisha S, Dr Manjunath B· International Journal of Adv...· 0 citations
Simulation experiments show that in a complex obstacle environment of 100m × 100m× 100m, the IAGA algorithm can effectively plan the optimal path, and the convergence speed is significantly improved compared to traditional genetic algorithms, verifying the effectiveness and robustness of this method in handling multi-c...
Qian Wan, Tian-En Lu, Liquan Huang et al.· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.