Roteamento de drones autônomo: um estudo algorítmico
This work formulates the Assicron’s version of the Close-Enough Vehicle Routing Problem, used for aerial reconnaissance route planning. We formulate the problem with the second-order programming model and apply heuristic optimization techniques based on a geometric property of the problem to solve i...
| Author: | |
|---|---|
| Format: | doctoral thesis |
| Status: | Published version |
| Publication Date: | 2020 |
| Country: | Brasil |
| Institution: | Universidade Federal do Rio Grande do Norte (UFRN) |
| Repository: | Repositório Institucional da UFRN |
| Language: | Portuguese |
| OAI Identifier: | oai:repositorio.ufrn.br:123456789/29656 |
| Online Access: | https://repositorio.ufrn.br/jspui/handle/123456789/29656 |
| Access Level: | Open access |
| Keyword: | Roteamento de veículos Suficientemente próximo Heurística geométrica CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO |
| Summary: | This work formulates the Assicron’s version of the Close-Enough Vehicle Routing Problem, used for aerial reconnaissance route planning. We formulate the problem with the second-order programming model and apply heuristic optimization techniques based on a geometric property of the problem to solve it. We present the results of extensive computational experiments with adapted instances of the literature, the tests show that our method produces high quality solutions quickly when compared to the solver. |
|---|