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

Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems

Autor: Vitor Nazário Coelho, Thays A. Oliveira, Rodrigo Silva, Matheus Nohra Haddad, Frederico Gadelha Guimarães, Igor Machado Coelho, Marcone Jamilson Freitas Souza, Luciano Perdigão Cota, Nenad Mladenović

Publikováno v: Evolutionary Computation
Evolutionary Computation, Massachusetts Institute of Technology Press (MIT Press), 2016, 24 (4), pp.637-666. ⟨10.1162/EVCO_a_00187⟩

International audience; This article presents an Evolution Strategy (ES)--based algorithm, designed to self-adapt its mutation operators, guiding the search into the solution space using a Self-Adaptive Reduced Variable Neighborhood Search procedure.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b40dfb712c1d9db788d2a5cb168cdaeb
https://doi.org/10.1162/evco_a_00187

A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups

Autor: Igor Machado Coelho, Luiz Satoru Ochi, Matheus Nohra Haddad, Marcone Jamilson Freitas Souza, Pablo Luiz Araújo Munhoz

Publikováno v: Electronic Notes in Discrete Mathematics. 39:99-106

In the Single Vehicle Routing Problem with Deliveries and Selective Pickups ( SVRP-DSP ) deliveries have to be made to a set of customers and there are also pickup goods to be collected. Although pickups are not obligatory, there is a revenue associa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::723a624ac102caed304fc51db7dfa462
https://doi.org/10.1016/j.endm.2012.10.014

Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search

Autor: Nelson Maculan, Marcone Jamilson Freitas Souza, Matheus Nohra Haddad, Luciano Perdigão Cota

Publikováno v: Enterprise Information Systems ISBN: 9783319223476
ICEIS (Revised Selected Papers)

The Unrelated Parallel Machine Scheduling Problem with Setup Times (UPMSPST) is a problem that belongs to the \(\mathcal {NP}\)-Hard class and it is frequently found in many practical situations, like in textile and chemical industries. The objective

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ecb1fb1c69abf374ce23c95fcae7a0fb
https://doi.org/10.1007/978-3-319-22348-3_8

AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times

Autor: Nelson Maculan, Matheus Nohra Haddad, Marcone Jamilson Freitas Souza, Luciano Perdigão Cota

Publikováno v: ICEIS (1)

This paper deals with the Unrelated Parallel Machine Scheduling Problem with Setup Times (UPMSPST). The objective is to minimize the maximum completion time of the schedule, the so-called makespan. This problem is commonly found in industrial process

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7e2cfd0861e1c2e172ff3b05ace3e5a1
https://doi.org/10.5220/0004884603760383