Solving the probabilistic drone routing problem : searching for victims in the aftermath of disasters.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorCoco, Amadeu Almeida-
Autor(es): dc.creatorDuhamel, Christophe-
Autor(es): dc.creatorSantos, Andrea Cynthia-
Autor(es): dc.creatorHaddad, Matheus Nohra-
Data de aceite: dc.date.accessioned2025-08-21T15:20:36Z-
Data de disponibilização: dc.date.available2025-08-21T15:20:36Z-
Data de envio: dc.date.issued2024-11-25-
Data de envio: dc.date.issued2024-11-25-
Data de envio: dc.date.issued2023-
Fonte completa do material: dc.identifierhttps://www.repositorio.ufop.br/handle/123456789/19195-
Fonte completa do material: dc.identifierhttps://doi.org/10.1002/net.22214-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1011187-
Descrição: dc.descriptionSeveral major industrial disasters happen each year around the world. They usu- ally involve limited accessibility, poor ground conditions, and toxic wastes. As a consequence, this reduces the efficiency of humanitarian operations. In such a con- text, flying drones may be a viable alternative: faster, no dependency on ground conditions, and larger areas scanned. They are also better suited for following the population and the crisis dynamic. For such a purpose, various issues have to be addressed such as defining and optimizing the drone’s routes, their energy consump- tion, choosing the relay points for recharging equipment, among others. In this study, several additional features from existing works are considered: first, a probability of identifying individuals is defined. Thus, each node can be scanned several times in order to improve the observation. In addition, the nodes are prioritized accord- ing to a given heatmap. The probabilistic drone routing problem (PDRP) consists of finding a route, that is, a sequence of trips, for each drone such that the sum of the expected number of identified individuals on all routes is maximized. Constraints on energy consumption, collision avoidance and drone-base assignment are considered. We propose a heuristic and metaheuristics based on the adaptive large neighborhood search for the PDRP. The methods are tested on theoretical instances, as well as on a case study of the Beirut Port explosion on August 4, 2020, in order to analyze the performance of the proposed methods.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsaberto-
Direitos: dc.rightsThis is an open access article under the terms of the Creative Commons Attribution-NonCommercial-NoDerivs License, which permits use and distribution in any medium, provided the original work is properly cited, the use is non-commercial and no modifications or adaptations are made. Fonte: PDF do artigo.-
Palavras-chave: dc.subjectDisaster logistics-
Palavras-chave: dc.subjectDrone routing problem-
Palavras-chave: dc.subjectHeuristics-
Palavras-chave: dc.subjectSearch planning-
Título: dc.titleSolving the probabilistic drone routing problem : searching for victims in the aftermath of disasters.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.