An unmanned aerial vehicle routing problem in offset surveillance missions

Date

2025-9-1

Author

Demir, Azize

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

148
views

0
downloads

Cite This

This thesis investigates the routing problem of an unmanned aerial vehicle (UAV) with a particular focus on offset surveillance operations, where the mission is executed from a certain distance and side. The primary objective is to formulate this real-life problem and provide a mathematical model for it. However, the computational results reveal that the exact solution approach becomes impractical for most of the problem sizes due to excessive solution times and memory requirements. Therefore, a metaheuristic approach based on a neighborhood search algorithm with simulated annealing is also designed to provide a solution approach for the management of such a daily operation. The main contribution of this study comes from the introduction of a novel variant of the UAV routing problem that reflects offset surveillance requirements. To the best of our knowledge, an unmanned aerial vehicle routing in offset surveillance has not been studied in the literature before, thereby opening a new line of research in operations research. In addition to that, it demonstrates the effectiveness of metaheuristic approaches for addressing the computational intractability of the exact solution approach in such problems by a practical solution methodology that can be adapted to real-world UAV surveillance applications.

Subject Keywords

UAV, Routing, Offset Surveillance, Mission Planning, Mathematical Modeling, Simulated Annealing

URI

https://hdl.handle.net/11511/116158

Collections

Graduate School of Natural and Applied Sciences, Thesis