A two‑phase multi‑objective metaheuristic for a green UAV grid routing problem.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorMarques Júnior, Elias Lawrence-
Autor(es): dc.creatorCoelho, Vitor Nazário-
Autor(es): dc.creatorCoelho, Igor Machado-
Autor(es): dc.creatorOchi, Luiz Satoru-
Autor(es): dc.creatorMaculan, Nelson-
Autor(es): dc.creatorCoelho, Bruno Nazário-
Data de aceite: dc.date.accessioned2025-08-21T15:38:58Z-
Data de disponibilização: dc.date.available2025-08-21T15:38:58Z-
Data de envio: dc.date.issued2024-12-04-
Data de envio: dc.date.issued2024-12-04-
Data de envio: dc.date.issued2022-
Fonte completa do material: dc.identifierhttps://www.repositorio.ufop.br/handle/123456789/19292-
Fonte completa do material: dc.identifierhttps://link.springer.com/article/10.1007/s11590-023-02013-9-
Fonte completa do material: dc.identifierhttps://doi.org/10.1007/s11590-023-02013-9-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1020601-
Descrição: dc.descriptionThis paper deals with Unmanned Aerial Vehicle (UAV) routing in dynamic grid sce narios with limited battery autonomy and multiple charging stations. Inspired by a multi-criteria view of real systems, we consider diferent objective functions, while respecting the navigation over forbidden areas and also a real-time fight autonomy. A multi-objective variant of Variable Neighborhood Search is considered for finding sets of non-dominated solutions. Twelve neighborhood structures were developed in order to explore the solution space, including learning techniques. The latter stores known routes in order to speed up the search. A case of study was developed where UAVs have to serve clients spread throughout a grid, representing a map. Each UAV starts in a given grid point with a given battery charge, where the grid is composed by four diferent kinds of points: a regular one and three special (prohib ited, recharge and client). Any update can happen on the routes on real-time, so the metaheuristic should handle real-time information and update the plan and graphics user interface accordingly. Any sequence of valid adjacent points forms a route, but since this yields a huge number of combinations, a preprocessing technique is pro posed to pre-compute distances in a given dynamic scenario. Computational results demonstrate the performance of diferent variants of the proposed algorithms.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectUnmanned aerial vehicle-
Palavras-chave: dc.subjectMicrogrids-
Palavras-chave: dc.subjectMulti-objective problem-
Palavras-chave: dc.subjectVariable neighborhood search ·-
Palavras-chave: dc.subjectBiased random key genetic algorithm-
Título: dc.titleA two‑phase multi‑objective metaheuristic for a green UAV grid routing problem.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.