Hybrid Approach for Multi-Robot Task Allocation in Search and Rescue Operations Using NSGA-II and Variable Neighborhood Descent

This work presents a hybrid optimization approach combining the global search capabilities of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) with Variable Neighborhood Descent (VND). The proposed methodology addresses critical SAR operations objectives, such as minimizing mission completion time, prioritizing high-impact tasks, and balancing UAV energy consumption. NSGA-II provides a robust framework for exploring the solution space and generating diverse Pareto-optimal solutions, while VND systematically refines them for better convergence and quality. Simulation results indicate statistically significant improvements, achieving average reductions of 4.80% in travel distance and 8.91% in mission completion time compared to standalone NSGA-II. Although the current framework does not support dynamic task reassignment in real-time, it demonstrates potential for practical applications in static SAR scenarios.

Authors

Institutions

Publication Details

Journal
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Published
2025-07-14
DOI
https://doi.org/10.1145/3712255.3726707
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hybrid Approach for Multi-Robot Task Allocation in Search and Rescue Operations Using NSGA-II and Variable Neighborhood Descent

Igor Machado Coelho, Milena Faria Pinto, Tatiana M. B. Santos, Laís Rios Berno et al.
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Optimization and Search Problems
article

Hybrid Approach for Multi-Robot Task Allocation in Search and Rescue Operations Using NSGA-II and Variable Neighborhood Descent

Igor Machado Coelho, Milena Faria Pinto, Tatiana M. B. Santos, Laís Rios Berno, Matheus B. Jenevain
article en

Abstract

This work presents a hybrid optimization approach combining the global search capabilities of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) with Variable Neighborhood Descent (VND). The proposed methodology addresses critical SAR operations objectives, such as minimizing mission completion time, prioritizing high-impact tasks, and balancing UAV energy consumption. NSGA-II provides a robust framework for exploring the solution space and generating diverse Pareto-optimal solutions, while VND systematically refines them for better convergence and quality. Simulation results indicate statistically significant improvements, achieving average reductions of 4.80% in travel distance and 8.91% in mission completion time compared to standalone NSGA-II. Although the current framework does not support dynamic task reassignment in real-time, it demonstrates potential for practical applications in static SAR scenarios.

Proceedings of the Genetic and Evolutionary Computation Conference Companion
Universidade Federal de Juiz de Fora (BR), Federal Center for Technological Education Celso Suckow da Fonseca (BR), Universidade Federal Fluminense (BR)
Openalex Percentile: Top 46%
Optimization and Search Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.