Última alteração: 2023-10-06
Resumo
This study aims to address the Traveling Salesman Problem (TSP) tailored for drone applications by considering the inclusion of No-Fly Zones. Unlike previous studies, this research incorporates the restricted areas that drones are not allowed to fly into the mathematical formulation. The study’s main objectives are to optimize the drone's route in the presence of No-Fly Zones, using Florianopolis as the geographic context. By considering these aspects, the study aims to contribute to the understanding of efficient route planning for drones while complying with airspace regulations and safety considerations.
Referências
Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2011). The Traveling Salesman Problem: A Computational Study. Princeton University Press. www.tsp.gatech.edu
Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Journal of the Operations Research Society of America, 2(4), 393–410.
Khoufi, I., Laouiti, A., & Adjih, C. (2019). A survey of recent extended variants of the traveling salesman and vehicle routing problems for unmanned aerial vehicles. Drones, 3(3), 1–30. https://doi.org/10.3390/drones3030066
Miller, C., Tucker, A., & Zemlin, R. A. (1960). Integer Programming Formulation of Traveling Salesman Problems. Journal of the ACM (JACM), 7(4), 326–329.
Murray, C. C., & Chu, A. G. (2015). The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery. Transportation Research Part C: Emerging Technologies, 54, 86–109. https://doi.org/10.1016/j.trc.2015.03.005
Xmobots. (2023). Nauru 500C VTOL – Mapeamento - XMobots®. https://xmobots.com.br/nauru-500c-vtol/
Orman, A., & Williams, H. P. (2006). A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem. Optimisation, Econometric and Financial Analysis, 9, 93–108.