Intelligent Drone Swarms to Search for Victims in Post-Disaster Areas

Autor: Matheus Nohra Haddad, Andréa Cynthia Santos, Christophe Duhamel, Amadeu Almeida Coco

Publikováno v: Sensors, Vol 23, Iss 23, p 9540 (2023)

This study presents the Drone Swarms Routing Problem (DSRP), which consists of identifying the maximum number of victims in post-disaster areas. The post-disaster area is modeled in a complete graph, where each search location is represented by a ver

Externí odkaz: https://doaj.org/article/81229b3061ff44a7a22338614e45f87d

Robust min-max regret covering problems

Autor: Andréa Cynthia Santos, Thiago Noronha, Amadeu Almeida Coco

Publikováno v: Computational Optimization and Applications. 83:111-141

This article deals with two min-max regret covering problems: the min-max regret Weighted Set Covering Problem (

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a435f7222b68c6988702b189be42947
https://doi.org/10.1007/s10589-022-00391-x

Formulation and algorithms for the robust maximal covering location problem

Autor: Andréa Cynthia Santos, Amadeu Almeida Coco, Thiago F. Noronha

Publikováno v: Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.145-154. ⟨10.1016/j.endm.2018.01.016⟩
Electronic Notes in Discrete Mathematics, 2018, 64, pp.145-154. ⟨10.1016/j.endm.2018.01.016⟩

Let N be the line-set and M be the column-set of a matrix { a i j } , such that a i j = 1 if line i ∈ N is covered by column j ∈ M , or a i j = 0 otherwise. Besides, let b j ≥ 0 be the benefit associated with a column j ∈ M . Given a constant

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d0b8d9e83a71d8c370573ba8811bb59
https://hal-utt.archives-ouvertes.fr/hal-02291661

Robust covering problems: formulations, algorithms and application

Autor: Amadeu Almeida Coco

Publikováno v: Repositório Institucional da UFMG
Universidade Federal de Minas Gerais (UFMG)
instacron:UFMG

Two robust optimization NP-Hard problems are studied in this thesis: the min-max regret WSCP and the min-max regret MCLP. The uncertain data in these problems is modeled by intervals and only the minimum and maximum values for each interval are known

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3056::ec0856885132f6a3cba8c11e76e2330d

An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem

Autor: Thiago F. Noronha, Andréa Cynthia Santos, Joao Carlos Abreu Junior, Amadeu Almeida Coco

Publikováno v: Journal of Global Optimization
Journal of Global Optimization, Springer Verlag, 2014, 60 (2), pp.265-287. ⟨10.1007/s10898-014-0187-x⟩
Journal of Global Optimization, 2014, 60 (2), pp.265-287. ⟨10.1007/s10898-014-0187-x⟩

International audience; The well-known Shortest Path problem (SP) consists in finding a shortest path from a source to a destination such that the total cost is minimized. The SP models practical and theoretical problems. However, several shortest pa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ff82f255f02322ec02f093442a2e100
https://doi.org/10.1007/s10898-014-0187-x